Register

SELF DOUBT PDA

• edited by
492 views
0 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 ??

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · test series(combinat...Next → · self doubt
← Previous in category · Context Free Languag...Next in category → · Pushdown Automata
Position:
Show:

Related questions

0 0 votes
0 0 answers
212
212 views
arpit.jha asked Jul 31, 2024
212 views
TOC PDA : Self Doubt
Can we have multiple stack operation on 1 input symbol in PDA ? Like below, here we are pushing 2 a's for 1 i/p aPS: This PDA is a solution to this GATE question https://...
1 1 vote
1 1 answer
1.3k
1.3k views
manisha11 asked May 13, 2019
1,284 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/...
0 0 votes
1 1 answer
260
260 views
manjeet singh asked Dec 15, 2024
260 views
My question about push down automata is when FA With stack read the input from the input tape then why it is moving left to right only . simply i reapeat my doubt is when PDA read input then after reading the input why is move in right direction only ???
0 0 votes
0 0 answers
782
782 views
Satbir asked Dec 10, 2018
782 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 >= ...