4. (10 pts.) Design a CFG equivalent to the following PDA (which accepts by empty stack): a, a; aa a, Z; aZ b, a; a b, Z; Z ?, Z; ? c, a; ? ?, a; a ?, Z; Z ?, a; a ?, Z; Z q0 q1 q2
Added by Juan Antonio C.
Close
Step 1
Start by creating a non-terminal symbol for each state in the PDA. In this case, we have states A, Z, and Q2. So we will create non-terminals A, Z, and Q2. Show more…
Show all steps
Your feedback will help us improve your experience
Aarya B and 61 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
We have the language L(G) = {abb^n a|n ∈ ℤ, n ≥ 0}, where {a, b} is the set of terminal symbols. Which set of production rules for G with start symbol S (a nonterminal) can generate it? (assuming all symbols involved other than the terminal symbols are in the alphabet as nonterminal symbols.) S → baSab, S → b S → baSba, S → b S → aAa, A → aAa, A → b S → aAa, A → bA, A → b
Sri K.
Construct deterministic finite-state automata that recog- nize each of these sets from $I^{*},$ where $I$ is an alphabet. $\begin{array}{llll}{\text { a) } \emptyset} & {\text { b) }\{\lambda\}} & {\text { c) }\{a\}, \text { where } a \in I}\end{array}$
Modeling Computation
Language Recognition
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD