Unformatted text preview: the two languages described in Problem 1a and Problem 1b, respectively. 3. Prove that the language L = { a m b n  a,b ∈ Σ and m,n ≥ } is regular. 4. Prove that the language L = { a m b n  a,b ∈ Σ and m ≥ 0 and n ≥ m } is not regular. 1...
View
Full Document
 Spring '11
 Staff
 Englishlanguage films, 2. Use the construction given in the proof

Click to edit the document details