1. Write a context free grammarwith start symbol S to detect strings over the alphabet set {0, 1, 2} the string following the form {0m 1" 2 mn, n>=0, m>=0} 2. Construct the NFA, using Thomson...

Don't copy answer from anywhere. Otherwise I'll give downvote Give me unique answer only=0, m>=0} 2. Construct the NFA, using Thomson Construction method, for the regular Expression a (a | b) ab "/>
Extracted text: 1. Write a context free grammarwith start symbol S to detect strings over the alphabet set {0, 1, 2} the string following the form {0m 1" 2 mn, n>=0, m>=0} 2. Construct the NFA, using Thomson Construction method, for the regular Expression a (a | b) ab