DATE

PAGE

AutomataThcary It s Study ot qbstack

Machines 2 qutomata,V
well as cmputq tioma proslems that
that cqn
con
6e solued usingthem
It rs most usefu comcept of SoEtwae lor
nahoral lenguxge PiDce&S Ing
Alphebcts Sct of Sym6ols ) Fioite)
Symbol Can bc gny letec,dit

SKin Finite seunne o{ SHmbols using Some aphabets.

Skings
)eagth- wl)
E w q6a
w 31
TE = 0 it s denotc as £ (cpsilom)
iso, -o,L L,0ol,(00,E

Sek of all skioss

Set ot q 2 whec tngth o
Skings an Stinj is not
 DATE

PAGE

Languggc Set ot Skings Chasen kiom E

whe IS alphabct
Si's deinitton Jtis a sek of shings ove sme
aphele i : A larg an bc Ginitt or
infinite

E
a , 6 ,k,bs,ab,6rs
4aba,a, 4,is,ti
Sct o Shrings

homSky Classificukon
AllLrammarsL * Evoj thpe k is a
Langs. qte divided popek SUbstt ot
into f tateaies
namly

lype0 Oarcaicked 6rmmaTurin Muhine

Type 1 Content Sensitve Lintar Bound AutomttR
Type 2: Conttnt Free Yu sh Down Automa ta
Type3:Kejular FiniteAutOmat<)
 FA)
inite Automat DATE

PAGE-

FA without output DFA N FAENFA

(2 A with _output Moofe Mealy

DFADete.cminishc Finite Automat)

ACmory s lowVery lieaited mcmat
Amma the Simplest modcl ot (Smputahm

2A

SetSetot all Statcs =A8,Cp

apus O13
tot inihal Sake
F Seto ina Stat=D
tansihon tunchon
dey
A
B A D
C DA
C 5
 DATE
PAGE

4SetSet of all Skings that Stert with o'.

Make DFA fr it ove alphebet í=0,1

o,o1,001, 011

)-

Debign a DFA sueph0g al skings of length 2

L00,01, 10, u
O

e
 DATE
PAGE

Draua DEA
kor the (ang. Gcccpinq shings
ending with 966 the aYphaseB 4-%6

L b, b6, bab6

a)Drauw a DFA f h t acccpts all the Skings Sturfin

Strfo9

6 4
ab1
 DATE

PAGE

raw DFA that Gctpts al the Shrings hauing

Euen no of a's 2 's

Odd no. of us 2 1s

Even a's2 Odd b's

 DATE

PAGE

Odd as 2 cvcn 6s

(2
Draw DFA that GCceps all the shinzs
whrch

Conam 3 Consccwive6s

Docs not Contin 3 consetuhive b's

a
 DATE

PAGE

Pqu DFA that accepls all the SHings

Stauting with a ltnding with 6

(13)2
Ncithe Stalhioq with n encling wth 6

(( P4
 DATE
PAGE
SMinas
3-
DATE

PAGE
NFA Non- DctecminishcFinite tutomate)
ith
Evcr DFA iS NFA buF NFA iS noF DFA)
No unigueOXt Sfate ormulhiple ncxt States
Ncxt Stte might jet chosen at andom
ALhe ncat Stakes Con 6Chosen Simult.

(A

wthb Thcremiaht e no ncat State Enc a stqte 2 NFA

is Shl Complet

2
Set of Ql States AB
inputs
init state
f Sct ot fina| Stqtes

Tansion x 2
Fonthion
A AB AB ,P
B

B
 DATE
PAGE

() VCa NFA that ccpl3 qll ShiogS wih o

Pra NFA that actpls all the SkingS that

Cmtainss oNA the i - A,

(arL)* (at)

2 DFA
(a) DrawNFA thgt 9(cepts all the Skings thet
Contain b t Secmd lest pasiho =S46
Contain
ars grs
NFA

( DEA)
 Lon vecsion of DATE

NFADF PAG-

O
(
Tfansihom State TG6les

NFA
O

thet FA

(
A

DEa)
 DATE
PAGE

(a) aw NFA that ccpt3 ql the Skings that

Contain 6 t s~md «st posihm

Conut it into is equivalcnt DFA

State ta6les
NFA
a6

DFA
 a
DATE

PAGE

(12 a

Pea NA DFA ceaingtothe jiven

transition tate

NFA

DFA
 DATE

PAGE

(
).

FA NEA
AlL tTansihons qte dettminis- Iransibon Could b nm-
. each tonsiñm leedst_dctuminisht Kansinm
CKectly 1state Couldlead to Subsct of stetca

toregch state, hc kansihon kor each Stst notqll Symbls

on allpssisle 2ymkols Shoula nccesarily nced o 6c dened.
dthncd
NULL moN( s ot gllowed NuLL maj llouwed
VesaningIs ditfiwlt Vsihing is casy
Backkaclin is qllouwed Bacikacking is not quays
Possile
Jt (equile mote sp9«c Rcquirs lcss Space
in ims oE Mcmoty
cachicalimplemenkaiom is Not fcgsible_(Lonuet
feesible NFA to DFA)
 OATE

Minimizinq DFA PAGE

F A B C
8 B D
C 8
B E

Statc Table alcad iseN

Non-Fia Final2
0 uivlences A8,CD 1E5
1 cquuslcnce:AB.3p3 {E3

3 Finel
equivalence A{83 03 {e
Reduced DFA

Total states now

 DATE
PAGE

0 cquivalence:

Final
 OATE

PAGE

2
uivalcnte:L } tudaji

Rcdued DE

(1 (114

(V315
Special ses
when thcre emulhiple Final stutes
when the(t are Untachable States (ho (nwqrd Qffow
on 0c stake
S unftq ch alle J
Remal
 DATE
PAGE

0ort

Output depends only upon

Mesty
Output dcgends on preaab
pcocnt State
inpur
I input changes output docs|- t ingutchanjes, oupot
Chenges also chaa
Moc numha st States qte less numb ot Sktks
Lquied Cquited
JnChfoneus outut 2 Stete Asynchfonaus utput
JEnesahom- encrahon
Less hgrdwre rcuitcmens . lare hedwac uiements_
Keact Slowu to inputs Reatt ast to inputs
dulput 1S plated on States Outpuis pkccdon fianshmy.

Easy to desin ifhttult to desiah

 OATE

PAGE

A(onstuct Mealy to produce 1s (omplimcnt of bima

Skin

nput utpu

Peaancaly acc¢phing the («ng. Onsistinj of Skings

o Shings Should end with
aa
ih
Uelf
afo

a/o

) onskuct qMooe rlachine thet_psints'a whenever the

Sequence ts enco unttaed í /o,1}