I I lo Tan Bo 8 9AM

MID 30
QZ i lo Mar 28
MID SO

Book Hop Croft Ullman Intro to Automate

and computation
theory languages
Marosa 1979

Rajeev Motwani

RIE SIPS ER intro to TOC Thomson 2009

Lewis elements TOC Pearson zoo
of
Kogen Automne and computability
Springer 1997

Useful in
Design and analysis and verification of
complex software and Hardware systems
gyt port Designing
FS M finite stele machines compilers
GroBT0 RE
programme
Regular expression P
Lysis
CFG Conlext free test a
gram mass software
D
 D
t l
programming switching
languages parsers circuits
Pattern
matching
text editors
Above are
helpful in
automated
structured detections
extracting text

2nd Part More philosophical approach

to of
CS
D computability and intractability
using TMS precise notation
of
their Fiefdoms
it
or not decidebiel
ayUaffniffuffowable undecidable
H Rings 3
Halting problem If H
7

decidable intractable
Does 7 an
efficient
solve that
algo to
problem
is intractable F any
also for the problem
 also for the problem
TO determine
TO C limitation
catabilitffs argol
a
Automata Computability Complexity
theory
timneedingthfode solvable not
to answer y easy
these
questions
us'Idin
Properties of to
crypto
design
algos
Codes

Finiteitutor mata models with limited

and limited access
memory
1930 TMS
19Eos sus Brain function FSM
1980g 7
Chomsky 7 Formal grammars

Problems
Languages L set
of strings
Input string n

problem Dees set L

 I o

Hamiltonian graphfrosten
Ls HPP hemiltonian
Lazy G as a
graph
Inputs g
ProblemsDoes CG 7 C HPP

A Machine problem L
solves by
accepting 1 rejecting n

Alphabet E finite set

o 13
of symbols
E a s G i
3
Ascii characters
Ej
string finite Seg
of symbols from
tool from E
stray from 4
C
empty string
1WI l w Wu Wnt n

lCI O
Set as infinite but elements 1 Strings
fi te
Closure I a 200 I 0220am
z0 EE
 E E
22 EX 2

Catenation
of two Nstring
z 24 n

y y yw
my see nay yn
C k N E n

Inyl tutty
language L E E
I o B
set all
of binary strings
of lengths
ace
On 17 7 13 0 kneads cuz

IN 1
WE 2
11 TW o T
O I
inw in w