Convert the following CFG into an equivalent CFG in Chomsky's normal form, S \rightarrow Aa | b A \rightarrow Ac | AS | Sdb | \epsilon
Added by Lisa C.
Close
Step 1
S0 -> S S -> Aa | b A -> Ac | AS | Sdb | ε Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 74 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
Convert the following CFG (balanced brackets) to Chomsky Normal Form. Use the definition we used in class for CNF and the conversion procedure we used in class. S → [S] | SS | ̵
Adi S.
Give a CFG that generates the language L(a*b*c*) { anbncn | n is a non-negative integer }. This question is quite challenging; you will first need to devise a good strategy for how the CFG should work and then create the CFG to implement the strategy. You might want to do the other questions first. No messy writing please.
Supreeta N.
Select the correct alternative from the given choices. The $\mathrm{CFG}, G: A \rightarrow B A B|B| \varepsilon, B \rightarrow 00 \mid \varepsilon$. The $\mathrm{CFG}$ is normalized using CNF. The obtained $G$ ', contains ________ rules. (A) 11 (B) 14 (C) 12 (D) 13
Theory of Computation
CONTEXT FREE LANGUAGES AND PUSH DOWN AUTOMATA
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD