edited by
557 views
2 votes
2 votes

Is L = {a bn an ;n > 0} $\cup${aa bk a2k ;k > 0} a DCFL ???

edited by

1 Answer

Best answer
4 votes
4 votes

L = {a bn an ;n > 0} ∪∪{aa bk a2k ;k > 0}.


DCF Grammar  for generating above language ->

S -> aT

T - > aU | bV

U - > bUaa | baa

V  - > bVa | a


 DPDA for accepting above language  -> 

selected by

Related questions

0 votes
0 votes
1 answer
2
0 votes
0 votes
2 answers
3
jugnu1337 asked Sep 3, 2023
329 views
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to