edited by
531 views
0 votes
0 votes

1)What is the main difference while drawing the PDA of {an bn | n>=0 } and {an bn  | n>=1} ?

2)How does PDA changes when we have 0 in it as a constraint .

3)For all other cases how does the PDA changes on inclusion of 0.

edited by

1 Answer

0 votes
0 votes

L1: (an bn | n>=0 } 

L2: {an bn  | n>=1}

only difference is L1 accepts null string and L2 doesn’t. while making PDA we must ensure strings not in language must be rejected.

if we construct PDA for L2 and just make initial state as final state then it will accept language L1 but also start accepting only a’s.

 

Related questions

0 votes
0 votes
0 answers
1
Xylene asked Nov 24, 2016
471 views
Can someone construct a PDA for ai bj where i not equal to 3j+1 ? Is it NPDA or DPDA?
1 votes
1 votes
2 answers
2
Rakesh K asked Nov 18, 2016
1,550 views
Is the following language context freeL = {$0^{i}1^{j}, i=2j+1$}How can PDA be designed for this language?
1 votes
1 votes
0 answers
3
alexmurugan asked Nov 3, 2023
334 views
Design the Push down Automata for the language L={anbmc2nd3m,n,m>=1}.Check the acceptance string by both the empty stack and final state method.