Register

SELF DOUBT PDA

• edited by
243 views
0 votes
0 votes

https://gateoverflow.in/679/gate2000-8

IN FIRST PART IS POSSIBLE THAT WE ONLY REQUIRED TWO MORE TRANSITIONS.

FOR EXAMPLe TAKE SOME STRINGS 

1) 2

2)020

HOW TO SATISFYING THEM WITH TWO MORE TRANSITIONS ??

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
manisha11 asked May 13, 2019
629 views
pda self doubt
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack. DPDA with empty stack accepts LR(0) grammar. Can someone explain in depth/or give good reference links?
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack.DPDA with empty stack accepts LR(0) grammar.Can someone explain in depth/...
User Avatar
0 votes
0 votes
0 answers
2
Satbir asked Dec 10, 2018
446 views
pda doubt
Consider the following PDA: The language accepted by the given PDA is: L = {(b^n a b^n a )^m | m, n >= 0} L = {b^n a b^n a | n >= 0} {bn | n >= 0} L = {b^n a b^n a | n >= 0} L = {(b^n a b^n a )^m | m, n >= 0} {bn | n >= 0}
Consider the following PDA:The language accepted by the given PDA is: L = {(b^n a b^n a )^m | m, n >= 0} L = {b^n a b^n a | n >= 0} {bn | n >= 0} L = {b^n a b^n a | n >= ...
User Avatar
1 votes
1 votes
1 answer
3
aditi19 asked Sep 3, 2018
1,939 views
PDA-Doubt
what is the DPDA for L=$a^{2n+1}b^n$ | n>1
what is the DPDA for L=$a^{2n+1}b^n$ | n>1
User Avatar
0 votes
0 votes
0 answers
4
aditi19 asked Sep 3, 2018
310 views
PDA-Doubt
L=$a^mb^n$ | m!=n is the following DPDA correct for the mentioned language?
L=$a^mb^n$ | m!=nis the following DPDA correct for the mentioned language?
User Avatar
Link Copied!