This preview shows page 1. Sign up to view the full content.
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
This note was uploaded on 10/03/2011 for the course CSC 544 taught by Professor Staff during the Spring '11 term at Rhode Island.
 Spring '11
 Staff

Click to edit the document details