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

Last 4 digits of your UTEP ID number: ____________________________

1. On the example of word bbbabbb generated by the grammar S → AaA, S → ε, and A → bSbSb, show how this word will be represented as uvxyz according to the Pumping Lemma. Show how the words uxz and uvvxyyz will be generated by this grammar.