2 language.
1.a) ProvethatL={(ab)na(ab)n,
fl=1,2,8,…}is a non-regurar
sulftse THfrTL ts k K€a/ryRLft^t6vh6t. rue LE;
c}PVslougtNc furoum
@ostllg-
l ^ / , R D t
HhvE s7fr-rvs A.
(o.l)n . k
l , 2 5, . . . .
, fr–
,k+t,..
(7t€tnst€
snt, pft
/-er r?t^tX=(ah)P6b)na^(rt
kLSo?tvtstlMnt€ spttls?#7E gw
. /= (ol)ro(o,b)\eL
w+tttyt =(d”b)n4+’l’o&iln ^/tttu(
(t ts n
hwrf,Altcr lo,v.
b) Finda contextfree grammarthat acceptsthe aboveranguageL.
S+ le
ft,b)’y, (o.b)V’ i,r,r,
tv
‘
)0
(nb)A No’/{-b)I,5b)’oo
XSXIa db
CST TTCLI
?r 1( got/rLoM5
https://www.coursehero.com/file/10256984/CSI-3104-Winter-2008-Final-Exam-Solutions/
This study resource was shared via CourseHero.com
2. ls the tanguage{(aO)n(ba)2n16bf)onr n=1,2,3,…contexftree?
lf so,
finda contextfreegrammar’for’it. } rf not,proveso.
5Vl(o5€ ‘Mtur Tllf LftNdvaeles CF , ff*to{Ltffi
lrs CwF tlfs P
LlvT vs fbrvr-rto.
Ler
l HEN1+5 0v4 ,vE
W O P O O F L
9vcu,ilqr a
w= (oi{
(^b)’re/ f Oo1ru’
qa, frn,o,MLyouEbb rv hvv
B Y P U U P I / U’ J TI A , @ W = , ( , V1 X Y I
Lkvtnu (vx1)