search
Log In

Recent questions tagged empty

0 votes
0 answers
1
0 votes
2 answers
2
there is a proof for equivalence of empty stack and final state but what about the prefix property cases empty stack cant accept regular languages which donot accept the prefix property isnt it less powerful than the acceptance by final state ?? what kind of equivalence they have ??
asked Oct 3, 2017 in Theory of Computation Venkat Sai 158 views
To see more, click for the full list of questions or popular tags.
...