eBab|b]ab B

Road woie reader

ermpty CeU fnite Conas
conto) 8Jates

Maiin features
0 14 hos a igiue input tape un
betth dlirect'on, llo us?ng my no
bounded n
move ekt-gu
14'3 d eterneinstoc fn the sene hat
move og
each Con furtion.
There 8 o no speciat nþut es. e
Hat a tue inital ime, tha tape Aae Soe
Shecsped tonteut Some hE&e mey be

No Sbe eia output deuice and no opten

tor halng ohen ewer ttue maohine helts
tae tondent
be vniewe output
ime nd sface
tomplezity oF TM
for du TM,+e dime tom leiy reten
to te measu re or the no. of time
header mo ves in toto 4me
moves
oF CeUs coter
on the Shate tape vohn
ohsn e nma cline
nitazes tor SOme JP ymbol.
,7me complexity
Ta o(
0( nlogn)

Shace Complexity
o()
R. ur Ohat ate finite Aatomata ? construct he
Hinemom State
Ans &- A nite Automata or FS MÎB a rnaaline.
hat Fomally Con be kgined by s tuple forr
(S,Eo,o, f)
[oset of stete, á’ Tuput alphabet,
6Taansitioh Punctio, 2o ’ntHal 8tate,
f’ Set Tnal state 7
Qb
b

Stepi- tHere '23 the lnaccegeTble-8 fate

Thus27 gets emoved Ae0, ne ther oc States
96 o '24' Can be acceRsed foom nihal fate
c20' hence get removed
Step 2 8- Thus ,the ne foanghon daam s
b

b
b .". Tognsition
Dragem of
nuinnized
Step 3:- O- equlvaleutsfates
Step4:- J- eguíyalentstates

Steps 2- 2-eguivaleut state

teps- Since,all stete are

Separateg.
 the FA for REa+b)*}
Azdden s Theorem; Degn the
Arden's Theorern ,iF 'p'rnd bat
Ans! According to
& RE then R', ther RE i iveh by,
n6 Hher
R- 8+RP, then R-Qp*
Theorerm,
70 prove Acder's
we Know,R tRP
R=S + (8+RP)P Sub SHteting R-g+e
) R-Bt &p+ RP 2.
R 9p +(g+RP)p 2

+9pD+ Rpni

LR6PA] pooved.
RE = Catb)* (hdtab) (*
aib

G=s’ Aasta, A’SbA|ss)ba? fid hasn

-..
Arsi- Left most Derívuton
S> Aasja A->
S > Aas SbA|ss]ba
s>Aas]
Ssas [A->ss]
’a sas[s>a]
a Aasasls-As
asbA asaS A’ Sb4 |
’
’
aabasas s ’a
aab
baasasA
’aabbaa aas ba]
 Parge Toee ? Constder CF9, S>aB,, A ’ b86E,>Ae
find rarse Toee fosting aa bba baba
Ans.'- Parse Tree is gn ordered roo led free that
gepresent Syntatie stueture ofa sting
QccOring fo Sone Coutext free Grammar.
S>aaB 'aabba boba

aabBba [A bB67
->aabhaba B>AJ
-’ aabbB6aba 4’bBb]
-’ aabbAababa [e> haJi
S
2abbatbaba A>EJ
9 ConStouct am eve vaeut pD
a a
for follouwing CFGi
S ’0A 1|08A
A
b
B

A
E,S > 2
b
B
 Step for Comvefng NEA to DE4.
I Convert the given NEA Jo ik eguivalet
Aromsio» fable
9. Create he DEA 's s Jart tate
3. Create the DEA 'S
4
toonsition
Create the DEA 'S Fal States.
fable.
5.
Simplyf y the DFA.
6 Keapeat Set 3-5
ntil no Futyor
S)o pufation î: possible.
Yorats MÚnmizatiou op fuite
Therm miimizatiou ker to tho Automata
Finite automata vsith a Comstuctbn f
miimum numberor States,
oich 3 eguivaleut to t given
The nunber oE States Used in Fiite uto mate
finite Aitomate
clrecty depends upon t Size of the
that oe have wsed So,it Ý Automata
the
mportont tove duce
nurnber of StateE" noe
oe Minimmze the
by dete cting thoze states of Atomafa
FA
hooe
presence or abgence oes ho t atecttha
a ccepted by the firite tutomata. tanguage
Jubortant concepk used nthe minimization og
Finite 4utomata :
() Unreacheble State
V Dead state