assignment1 - the two languages described in Problem 1a and...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC544 Assignment #1 due Tuesday 2/15 in class Problems 1. Give the state diagrams of FAs recognizing the following languages (as- sume Σ = { 0 , 1 } ): (a) { w | w begins with a 1 and ends with a 0 } (b) { w | w contains at least three 1s } (c) { w | w does not contain the substring 110 } 2. Use the construction given in the proof of Theorem 1.45 (Theorem 1.22 1st edition) to give the state diagram of the NFA recognizing the union of
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online