Register

PDA-ACCEPTANCE

633 views
0 votes
0 votes


//  pda accept the string in 2 -ways.either by final state or empty stack.

my doubt is in the diagram at state q1 is for every 'a' it pops one 'b'.when no of 'b' are equall it accept or not.

and what is the language accepted by above PDA?

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
2 answers
2
Pronomita Dey 1 asked Nov 1, 2017
512 views
PDA - Acceptance
Why is the following language not acceptable by a PDA ? L3 = { anbncn | n >= 0 }
Why is the following language not acceptable by a PDA ?L3 = { anbncn | n >= 0 }
User Avatar
0 votes
0 votes
0 answers
3
radha gogia asked Dec 14, 2015
520 views
why do we add an initial state while transforming PDA acceptance by final state into PDA acceptance by empty string ?
I have gone through this link already but still couldn't catch up the logic , so please clarify what is it trying to convey ? http://cs.stackexchange.com/questions/44195/...
User Avatar
0 votes
0 votes
0 answers
4
Hemanth_13 asked Dec 25, 2018
377 views
Self Doubt on language acceptance
$L= {WW^RX| W,X=(a+b)^+}$ My question was why can’t this be regular?? Consider below regular expression $aa(a+b)^+ + ab(a+b)^+ +ba(a+b)^+ + bb(a+b)^+$==>$(aa+ab+ba+bb)(a+b)^+$ wont this language generate all strings of L as we do for $WXW^R$
$L= {WW^RX| W,X=(a+b)^+}$ My question was why can’t this be regular??Consider below regular expression $aa(a+b)^+ + ab(a+b)^+ +ba(a+b)^+ + bb(a+b)^+$==>$(aa+ab+ba+bb)(...
User Avatar
Link Copied!