in Theory of Computation edited by
467 views
0 votes
0 votes

 

in Theory of Computation edited by
by
467 views

2 Comments

I have a doubt here :

Initially we know that the Stack contain Zo as the Symbol, so when say symbol 'a' comes I should have configuration like    d(A,a,Zo) = (...) but i dont have such configuration , so it will hault by rejecting the string. If i assume the top of stack to be empty also then also when say 'a' comes i will do d(A,a,^) = (A,a) , now when second 'a' comes i wont be having any configuration, so it will hault rejecting the string.

Then how it will accept any of the language here :/

0
0
ace made their own PDA ...ACPDA
0
0

1 Answer

0 votes
0 votes
D is the answer

1 comment

Explanation?
0
0

Related questions