1,626 views

1 Answer

2 2 votes

Z0 being the initial symbol in the stack and E being null production.

• edited by
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.1k
1.1k views
rahuljai asked Nov 30, 2018
1,140 views
Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X}, where z0 is the bottom of stack marker. The set o...
1 1 vote
1 1 answer
905
905 views
rahul sharma 5 asked Aug 2, 2017
905 views
True/False1. In PDA, if Final state = phi(empty) ,then language accepted =phi.2. In PDA, if Final state != phi(empty) ,then PDA will always accept at least one string..
1 1 vote
1 1 answer
1.6k
1.6k views
Anmol Verma asked Dec 2, 2016
1,553 views
how $a^nb^nc^n$ n>=1 is not CFL....??
0 0 votes
1 answers 1 answer
3.6k
3.6k views
shekhar chauhan asked Jun 15, 2016
3,573 views
What does this Language Represents ? And what is the machine which is able to represent this Language.L = { a^i b^j c^k d^l } where i = k or j = lHow it is different fro...