0% found this document useful (0 votes)
7 views

Adobe Scan 18-Sept-2023 (5) (1)

The document discusses theoretical concepts related to automata and formal languages, including various types of grammars and state machines. It covers topics such as transition diagrams, finite automata, and the construction of languages with specific characteristics. Additionally, it outlines the rules for generating strings and the properties of different automata types.

Uploaded by

amansingh.hjp1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views

Adobe Scan 18-Sept-2023 (5) (1)

The document discusses theoretical concepts related to automata and formal languages, including various types of grammars and state machines. It covers topics such as transition diagrams, finite automata, and the construction of languages with specific characteristics. Additionally, it outlines the rules for generating strings and the properties of different automata types.

Uploaded by

amansingh.hjp1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Hlsl23

FLAT TOC Pag o.

Theory ot Cernbuttions
A G
cOllecten
all tpon g Ranguage autemata
Gamman
é(a, b)
Length o 3 a=8
tfe), (b) ka,t) (ta) (aaa, aba, baa,
bbb,aab, bab,
abb, bba)
btat with b end with b.
a, b)
(bb, bab, bbb, bbbb)
-la,byc,d)
Length 2 y ='6
(aa, bb, ce,dd, ab, ac,ad, ba, bc,bd, ca,
Ce,cd, da, db,de
ale
stings mith ngth O.
2 = t of all tings uith Rongth I(a,l

klene
(a+b)* y08,ab, La,bb
pesitive cloweae poibilitiu
au poi ble encet
gonui).
Rsoducton ule

Vauiabletenninal
SYnale
start ymbal.

’ asb 8
start
ymbol
|Pgo Na

S’ asb| S=asb DEA


aasb b aasbb without with
ab a'b2 aaasb bb oP.
a3 Eb3 oP
DFA
M20 ’NFA L Mulay Nachins
Rolloed y cquol no at EN FA dolte
b)
abab) )
S ’ aSb QNem empty tinih set oe dtates
S ’ bSa
abSat
dbab
bsa
basba
ba ha A ratomata aa, ab, baj bb.
E, asSb bsa bSa bSa
abba baba
lemgh.

Lamguagenalw) - n,(w)
* chemuky eraschy languags |s2
iyee -o (unestfched qron)
dyee -l (entet Jeraitive qramma)
ye - 2 (centet fpee
gamma)
dyte -3 (Regles qomman).E hos Sa
ybe-o XE attat one. Vaiable
mettohiern 6oumula.
Yc (v+T) * Rule
Total
toenstion
S’ asa S’as stutes - mt 2 -2+2 =9 &tate
net pe ble
Pae No,
|Pago Na

Total = nt) = 2t|=3


4 tute,
tates
steing accpt hegi ya nh2
laba ’ tng
make toanshen diaganse
a

A
to

tras tate
X.

sa,b)

a
a

a
PeNo.
Paes No.

becond lost oit s 2 shing accakt.


n wmed 2-0 (0+1)* 1 (0+1).

OFA
Dead ontigusatin l alleed.

Stoing- baaab baa ba ,aabab, QNutiple Cheics a available.


a nat ate
abaas
ababa available coeerdn
te
ababb
3. oelowled.
alloueded.
y.
Digital compte 4 NenAeteninishc
b
ase etemiistt

Aeal eemp utes.


b 5 casy
wndenstnding
6

GDEA ohich Atart sth e and end


Sane
ko etong acakted, ab aab, abb
aaab-}
t. NOFA
T'age No.
Pe Na.
with lal
DEA which mat stat A
end with
8
(AUB)
L=E bas, baa ba ba, bbba,3bba,

raruitien TRble
Net
(aue) cuntoolf
tate

Q: blo Mesly 2 Meoray


Mealy m)c Mealy Mlc Megray mlc
|Dutbut deberds en
m , ~,8,4o,A,4). pesent state 9 t l i n a a s i ndtteo
t
eutput puset I)P.
alphabet Gunctio
emqth n, thn o|p ength-n )P’ntl,
1 b
3
ol2
1

cek.
state btate 6
b
8=Tramuitien
(olphabet) synboe înpud S-
o o
solt Net
nt hay
Toaniie Mo
oP. Aetomato
with Finite cas
Length->6 aaabaStaviy Macin
- Meere
cuchento
9mteodctien teco
machine meee
42 C'S
T-T
O o
(o,1) x Co
= SX Atte tate
Net cent
Mee table
of Tramaitier
(22/)
Na. Pier
Dte
7,96, Dcte
Pgu N'a.
t teucier to Mealy Machin
M,=S, E, s, 8, a, qo3 PDA Deaigning
bl1

blo
(ayb)
2o,b ’ 1
Qob olo
o,2"<o20
O,oloo

Langth a o|P’n.
I|PSabba tantion
Toanglten
O,Zo’ Ozo
Net o,0,0.
Stat
State
Staing
o

You might also like