INITES TA TE MACHINES

Finte Automata

fA withoutput F4 without 0p

Moore Meay DFA

mahin Macine

hoite state Machins

the Simplet modal oP omputatibn
* tis a
liritec mmoy
Automata U an abrtraut omputing
Definition: finite
dofvie. t it a mathorm aical rodal of a system
inpuks, outputs ,states and set oft
uth dusaoBe 0ccure on
ifiony from state to state that
hons
input asqmbols fom alphabet
2

* Itt Tepgesentationg
Grphica ranntion Diaqcamy o< Tanuiten tabl
(O
Tabular ranaition tabe
)Matunakal Trarni tion fn o mapping
 state thhansthion whuc A
formal
ltat OL, Oto- vohus It
- Initia
state of is h à' 8: FA
Start / Qxs>9is Dohni
ediote tni
tnite of iuqtam a Cos is is ton
ial a a
state Ahe doreat (alld +a finte 5-
outomata of
stoate qaph ed state set
tuplu
(Tanston
qaph inal the FA
toTTesponds aLaptalso Calltanation
statstates, ed called ihay ,
esentewidth fnal QsouaedGnaph)
adosfuo Acaplnsg
tate Einal/ 0 inihal the ae
state Alfn
phabeks States
to
away the cwith Srate

a ot laansition
’
’ ’ ’Rous state the
luo Transition
Ihe
statei) mapping
ho TheEntriesOumns and
transition
pasamat
Cuyrent H
State,
udSymbol
Curent) aeptstarting toTApondoStatesto a isTable
a es tn
tuncion wrrepondu
conepond synbo ba,ically
state sate state fo
/hrarshion
e
passed o is to to and hat
tuch a
mazkodmakad net input atun takestabla
Can to thn shatsyabol
es s
this with with a
be dunotedl by DAL3Ontalion,
va
an
enad haunsi aow
hoxtsta F
sta) [reat
ion () state
asn
 Aplicatios Deterministid Finite Automata (DFA)
Compiln dsgn
+It plays an înmptotau rolt in The FA avR called DFA if the mahin is
dusign and analysi 5
+ In suitch.ing thuoxy nd Yead an input stbina ong Sumbol
at a tim
is applced
ot digial ctu tty .aut mata thuony Deteoministc refers to the uiquOness Of the compdatror
Slo d b/wsystems
Desiga and anaysi of tomplr ho
the proganm automata p fom
- k pove tornts + In DEA, thuu is only onL path tor speifrc
theoxy is yed the curent state to nt state
tannot
} To duiqn frite State machúns Suh as
* DEA does nd atopt
the nul move, e, DEA
Moove and Moaluy machine
changz State without any. Ip chaater
and wod in lajal
kangagcs DTA (an ontain mutiple oal statos4 js
thue frmal Jonguagu au wtkal or the Analyrs In compile
proqgarming, langungus o initral
upa of finite Automata ) 9,19,- nal.
- intemudaate
Finute Aoto mata
|fite Automata uithout ofp inike Autonata with oe
foomal Definition of DrA Is Same as FA
Doteminstic Non-Detoministi No-Dot rminist c
finite finite FiniteAutomata raplual Ropmeundatin 0f DTA
|Automata Aukomata witth E moves.
(DF 6) (WFA /NDEA (eNEA /ENDEA
DFA Can be upsesented by diqRaphs allesd stte
Moore Mohin diagpcum
|Meal, Machrn I. The state is tepres ented bg veties.
 shoys
Q. The at laboled
(cda:) with V chaated
Hhe thansihon
an>
natkad with
3 Initial state double ciRde .
final state i dnota by.
ifa stoing
A lorgaas aueplare ls de fnacl by
ee iP it is
@iS QLeptad by ahine M,
? Design DEA withS So.1? arupts thase stain
tehing th final state Ehy taking Shing w
W
oith 0.
which staot with I and ends
3Not acuapted i-lf shing not raa china,the final state 00, \|0-r
Ans) L- 10, 100, 10, 1000, I1
minimwm longth = 2
L fe (rombAs B(adyay abselon
a
noof Brates - Iinangth |+|
=Qtl= 3
noof Sate =min Shing longth|+|
? lontut the qaphical esentation of DFA
initilat
6,b. qa
( Design DEA oo the
folouing transition tae
input
State
Pruet stote
a b
NNN
C
 Sates InputrImaginfximple-
s maton
Auto 0Y
botth
more singe A
an An lheu
Thuc
than State
UP U1Wi
- 2- |- ta0-
l No
s callsdvatoclevados
OT one wil
- callo
all to be an
woiting.
Aboat to rom aontholles final only be
Jerves
floo floor thfloo staot
to states ne
qo ontwo On floor
pfirt eith two - as
6taat
in well
foor tself. floors
from Finite and as
inside final
none
stato

Tronsion D2w2-
WI State -
W2DrN UP Albout worti
(w1) talble hg-saond down
todo
qiven 90
UP Wi

<O,2 O2
DNW2 WI W2

bolo
dôwn
foor

Inputs
(D2 D2 U1 call
2
to
2 1-1)

W2
Call
UP) D2W2. lo2
(2
 NDFA MooYe Machine
Diffonu be DEA &
NDFA
, finite Atomatd wthout o/p
DFA Dehrition:
confgaHon is
Dead oqaton &NoT * Doad
allowed MoE,4,5, 2>4:
allowod
#Multiple choies
hofos aL
a Q shaa finite set of states
Maltole chone ae NOT
aunulab& wanith tovaponding availabi er Copondiny
b an iput
Dgtd tomputey a Non detog monistic featu
input putpu
dutoministic
hot absocao wrth Aeal
Omputey
Duigring, &.Undistanding- is Desiqnng. anel wndrui artn
diffudt
More no of statey Leis no statey
he transihion fn is not dfnd hu a, b ae outputs
mans 00l0 TS
iS iven to reere Ma
for au of the input vaunbles if an nput song
theout ot will lbe
aaab aa
state
an output ater wiHh eadh
get(n+) noof
 Cuooent stato stote
Mauin input - b
input
wth eath hansiiol State
Fas0hates a ofp ette Shate
ip/oP
2
wtth a
ky the edge labelled 2
3
* The ontut is
plae duing. a tansitiovn of 3
+Os alanys tko
Sates
Doffevouo blo Moore
Dflevanua & ealye Mohins
b
b/o
a/o Moormachine
b'e Mealy Machino. on
on prese * O/o only, dapends
i inndsbing
abababaababb * O/o depernds present s tale
Olp is 000101000010 State pie sent iyp
* Vp length n p Sting
* Inpats qven>we qct n Dutputs. * Inpd staing of length n longth (n+)
dahnition: ’D/p Aongth is aluo n
,S, 2, 4.
Veie,2, A
6-inote sot of sates
É. input alohabet with cock
ÑQXS’a
d= Trangt hon fn
* faatoy than no0 * Slewe than Meal
6 initial state
x when onveo toc to Meale
* when converted to mo0,
no.of slatul winl increas e no changc in e no.of
Slates
 UNIT 3
Defnition: °angas is REGULAR #
zings
wLQ0 th we ongge
Rogul
tallad.
Ha writtenalsoas y lngoage A
a Mehod
Ezwzcssn
Requlas
Lst
tan L=@,
R A put toEXRESION
be is hat Rprsont
a a
Rsqular nul any lation of
to
aapl
stoing number a,
aa,
Epres
a. a &
’(2,3-..) aaa, tinite anguage.
string, LANGUAGIES
ion stoing aaaa automata
ove of in
gero
alphabt plae
lnatn is
of
*,
6
6) 6 (4) 3
Union dnling for
L Kloon Conatenati 2uguda,is 4
atb) R0gulo is
R R,UR2 - of R=a eah R- R=
A
can at (losug RiR2
. two symaol
take on
of - of ,L(R) RE a=
A, any Roqulas Ragyul
Roqul
tuwo aana aL(R)={
A, RE is eZ,a L(R)- A
asa,b (R) num sion
a,aa, iS
is RE aso
is bor auo fs donoli
ab, abo is
value aaa, Rogua ao zoguou. zequloa
ba, zeguaa ng.Mongt300h
aaaa, tequla emply
ofaba, expiesion
- jab}aub
a set
bbanda,
aabac s
 ) largth 3
atmo! trnost lurath Lorgth 2 btampler of
RE
dangtd Deratel Dootud als
1, van yab.
sab)
langu
by be
4, by
by
ar
bj. aHb) (o46)
l+b)
aiten w
as
$-dnot
dunotd
ed
(hdunoted (a+
8)lnHab) (atb)
b) (a+b) (a+b)+6) (o+b)+ a
by (a+ by
A+atb) b dunoted
Catb) A
b) (atb) Dr
E
or2

F is by as isaDefinition:
nguage Kleene
is
a e-ene RE -5
S-{0. knouwn wsrhng the alang Kllosua C abt -
clouL word,
A,mOTe
)
Stao
of 1 Supeascoipt.
ay
hat is CAtatb+ a,
aiton staings is thun even in b, norn
nameaa
an Kleene * of the uhicnduppoe ab, 2bs
ope s"a
of hun closwie. afHto the null
of vatron
alphataut stoing any arn ba+ abb,bo, and
phabutlotters
to,1,00,01,
hat the
staing abbt
is otmakes Ly s*. na Weof
. alphoet, bab,bbay
bab
1a

g, of 10, Sa,b,
it calAet +bba}
an an1,000, hí of
aphabetab
deroteWe l ters
so
alphabet b , no this
infinite 0\0, and
bbb, tation larquog fr0m
01
2
defin e
Lonido S-§ a b A On
ongth o
2- sot of all stoing with
( does n indude the Abut incuole
,» 2-faa,bb, ab, ba,
al othur stoings of s
abo waiton a s.s- {a,b asb
a.b Con catenation ab
S set of al staing ith ength 3 -
onion =a,bi
- auo woitteny &..i- Sa,bl.abl. fa.b
kteen (hß une = A+ataa t aaa
{oa,b,ab, ba. ab)
Saaa ,aab, aba, baa, ab, bab, bba ,bbb ababb and r= baa hen fnd
1v == ababbbaa
î) uv
= Kleene Closue ti) vu = baaababo
-Sol of all staingsof all longths possible on o&b 1) uu ababbababb
=Con be woiten a (a+b)¥ iv) vy = batbaa
v) uuye ababb ababoban
? fnd Klegne Closuua of
inhni orgungy i) saa, b
Posihive losuwe aabaa, baaa,
- Sel of all (aa+b) -h, aa,b, aab, baa ,
staing of all nongeo lengths po baaaab,
 1 ) ,ba rample
aaba, aba0 1f S=a , a9,aaq,T- bo, bbo
(atb)- fa, a,ba, aba ,baa,
a, abaaa-.. thun ST= 3abb,abb, aabb, aa bob, aaabb, aadbbb
ba aa, aaaba, aaba
That is all strings from s is oncat enated coifh
The kanguag L dalinad by Keguloa eapreHbn String from T.
abta tontain all the stoing O a's ad b's
that sat and end with a. # Can have )f s-kent atsa, bb, bab , T= $A, bbobb
hotring but bs inside
L= A aa, aba, abba, abbba ,abbbba. . Hhen ST=}a,bb,bab, a bbbb,bbbbbb, babbbbb
2Find a RE or d 6(oi bing folowing langayc
Thu larguage dafned by RE
RE = at b containd
i) L= Sa,b, Cf
all the Stoing,s of as and b's , whue all a's aue
Arn) RE = atb+c
toma before bs. if ang)
L- in, ab, aa,db, bb, aab ,aaa, abb, bbb )A,a,abb,abbbb.
no need to be Samu noof a
6b Ans) RE = A+ a(bb)*
bample
Cooc RE -(atb)*a latb 2Find a RE ova aphabet So,? to desoiba al binaoe
numeals without oadiny 3eAes (erept o itsel f.
- set of al wod L- 30,!, l0, I, 101, 100, tl0, tt,
Bover S- Sa, b} wth a
Some whe a)RF
 Algebra of Raqaar Exprasion 9Prove thot st
Paopehe of RE We kru) hot ev uuod of S** is
modscup of s
1: (Rs) +T - R+{s +4T) evy w0Td in Sk is mad of S.
3. +R = R+Q =R Then
S+R =R+S whch impbus Gt* s
c )
5- Ro = ¢R = aso s)
6RA =AR= R by above inusion e G) and 0)
1 Rs)T - R() S* s**
8. R(S+T) =RS+RT - dinbuhive
q. 64T)R= SR+TR
= A
13
(R+ s)1- (p*ct)' _(g4st) -gtst (o+s)e?
R (sRt)*
(83) -(R*)' as*)*