Date Saath

Cuestion ope 2019.

Qla) Lhat FA?Exooio ch exomple Elcbrate
on 'Atomaioo ond (EA)
coplexity
Congist ot {foite set
Afrote automato
of tates and set of onsioog rom so
ioput Symbals chocsen fsom
tof each Soput heir fs one txors?ion at cf
och stoHe
represented by 5 tuples (0E S, qyo.E)
s afinite non-empty set.
symbols colled alphabets

O,

here,

Pace No.
 Date
Gaathi)

Automotion
Atemaion is he proLess ot ceoting o uhliziog
Aechnology to pertocm tosks wth mihimal huron
Soteension
Tt fovoes. empleying cotool suBems, such_ as
Computer proq(0os. mochinesy,ete, to execute
processes ol operaRoos SAhout constont manuol
input. o
TRs s 0cheived thxaugh he develpmert
agoithns, suics or pred predel ioed astaucions.
auturcuslu,.
not eobles mohioes to eXeute tosks
xeduic he reed for direct humon Snvolvemert
waithea a
Conplexity relers to the level d fothicay exísAence
System. problem oY process. A nvolveSnts, heretion ships.
ot numexoUS Rcter coonected compone
o oriables.
system o sceroío oen pesets
A complex
chollenges due to Hs mulltoce ted noture,
Rgne level underStording.aralysis,
equiting a
monacemeot to novigate and solve problems
eleckvely

Page io.
 Date
saath
al Cb).ConNert follouq reqular exp1eSs'on o heir
-equivalet EA.
) Catb)

Ihe lanquage qeneroBed ill be

he requlor expre sioo aill be

() (o+bc
Tre lanquag*, qererated ul be
SO.
Ahe (equlor espresion a be

he languoge genero4ed collJae

So,
Pace No.
Date
Gaath)

Ihe requlor expressioo coill be

)AoloslAA

faf the sBhinq oolloloL and IoO1O10 Rod

Rigbt most derivaiao
- for the gting 0ll0\0
(9 leftmast derivotion

00l101A

6) ichBmo st derivation
Page No
 OBIA
Ao\oS\AA
B|is\oß8
Date
saathi

O0B1S
0IA

00BIS
00BI10S
00B11OIA
A OS

IAA A1AA

lloOIA
AOS

PageNo,
 Date
Gaatht)

6) rightmcot derivotioo

|\00B0
1001SO
I00\0BO
|00101O

Q2(0 Exglaio punpiog ermna ord s applicatons

Yusmpiog le osMO ' used as o pcotf or regularas
Thus.
oe
oways oisieg purmping \enna. IA canmo
uSed to psove thot a civen \anguage fs (eqdgr.
Let L be a requlor onguage Tnen thothere everyexis
c CQurnoig lengkh Such
We ton brecok wtoto Ahee ghigs w Y2,the
folouang_ Condihiong nust be gottsied o he

Purnping leSomo i3 to be agplied to show tot

cerkain lorngaye ee are not egulor. Tt shoud
never be used to prove o lanquage it egulor.
lto I&L fs vegular, otslies pumpirng lemma.

not
requlor longuaqe
Iiate

Ynding e- dosure
E- dusure (9) ?A,B.c
2-closure () 20
E -cesure (c) =
Tonsilicn tode for DFA

Fnge ,
 Date
Gaathy)

Tronshon dicqam fos DFA i5

ong uage s by
03()0suss the Chamsky mesoxchy ct clasakon.
tckfog suitoble exaple e0th

To REL TM
CSL L9A
T
0A
(RL (FAY

Chonsky ie xoKchy Rs uded înto 4 types Tpel.

Tupel, Type 2 ond Type 3 cohch has ts own
lanqucageond nachfe bosed on omplexthy
Tyge 'o
T hos reurave enumerabie anguage. this
qxtnnOY have hiahest qeneraie pouer ond can
Qeserate longuages hat even truring machine
(an undergtond'
t6 the evel o qrÔMMaY COmplexits is law the
\onquage generated and nockine bas high
Conplekiy
Page N o . 1
 ate

Ihis type has ontcyt sensitive qommor whi

produce contest hee lanquage.
he language cenerated by his gronmaor
eccqalzéd by ioeor bounded machioe
type has_ coodcxt fhee qiomna whih
produces Conlex fee \onquage
he lanquage goneroted by tis qrormoY
Yecagni zed by ushcan atonato
3
ype hos requlor qromma cohich
Iequlor
he \anquage
\onquane geherated by ths qomYYar îs
(ecogoized b "te automota.
fs he cosrplexths d he gromma is Kgh
Te langage generaBed and mochioe uséd
has less complexhy.
Cu 0).bovert he aven xomraY So Chomsk
Nomal form
The fiuen (FC s.

A’ aAslos la
Fage tNo.
 Date Gaathi)
gep 2. eleninatins sicde non tee oinal

AoASLoslo
SbS\ bb

Step3, b xules &(AE

A>a

hence,

A’ A,X \ASa

Q46)Expin
) Xecursively Jor Enucomer alale lOnquage
A) CxÃlkoch omol focm
t) Recuxsively EnuMerable longuage
These Ioquages beong te he ighest leeld
the Chonnsk hieroxchy
Aloquage Ps recur[uely enuner alble R thefe
ess o tusing machine hot acegts
hen a Aeung mchine mepts a anguage, A
meons hat r y stin n shot lanquage,
the mockie ll erethall haH n an acepYing Page No.
Late

Ganthy
etoBe
This arguage Can be enerated
Turingtypemacire oop îndetiey

Ahe languaqe.
mochioe detcils obng cóth
poblem. Also stote s oppco-fos mdel o
lig mochine s o mahemacal
Computaticn rot deline abstont conputer
Os invÊOted Ra 1436, by AonTuring
luzing mochie can be dlined' by 1 tuples

ioput olghabet
irilial stote
F get c oal stohes
= tope olphaloet (too)
B= ank gymbol
8= x
The haltog prcolem of ted turing mochioe
pOgsible to determe hat cihenther tie
ing machine l ever hot or not

Page No.
Date Saath

Consteuct 0 OA for
shere w is he reverse o
et tape a the
Iarguage be
\albbcb|b]ae
let stack be

Anorsion docqrom asl be

lo,o/00
bbe
bb/bb
ao
czolzo
Tata

Page No.
 Date Gaath
mochioe
Mealy mochine and Moore into n00re Ond
(onvot olbusng maly modhine
machine.
1Mealy machioe 6
4Mealy, mackioe can be detoed uSing
tuples iAz,A. 6,À. Vos
C= fote set cf states
$- input symbol
8=ansiionfuncon
ouhqut functon

Moore macine
More machioe can ke delioed usig 6
taples ,A.s,A, o

A= output keeeier) state

S = Onsiioo funchon
p iia stote.

The tronsion toble for Mealy

machne s 09follous

Paqe Na.
Date
Gaatht)

Sbte input

Tronsiton o diagron for the some

alo

a bto

alo

Txanstton_diaram for moore machine

Page No.
Date

Saath
(o)
X

Page N