1. Model of a pushdown automaton. ANSWER LINK +
2. Definition - pushdown automaton. ANSWER LINK+
3. instantaneous description (ID) of pushdown automaton. + ANSWER LINK
4. move of pushdown automaton. ANSWER LINK
5. deterministic pda ANSWER LINK
6. Construct a pda A accepting L = {WCWT } by final state. + - ANSWER LINK
7. Construct a pda A accepting the set of all strings over {a, b} with equal number of a's and b's. +
ANSWER LINK
8. If L is a context-free language, then we can construct a pda A accepting L by empty store, i.e. L = N(A).ANSWER LINK
No comments:
Post a Comment