CS 3350 Automata, Computability, and Formal Languages
Fall 2018, Quiz 7

Last 4 digits of your UTEP ID number: ____________________________

1. Design a context-free grammar for the language {0n12n+1, n = 0, 1, 2, ...} = {1, 0111, 0011111, ...}. Show how your grammar derives the words 1, 0111, and 0011111.