This preview shows page 1. Sign up to view the full content.
Unformatted text preview: any other nite language. Problem 3. How many dierent languages over the alphabet { a } are accepted by two state DFAs? Name them all. Problem 4. Give DFAs that recognize the following languages. Assume = { , 1 } . (a) The set of all strings with 010 as a substring. (b) The set of all strings which do not have 010 as a substring. (c) The set of all strings which have an even number of 0s or an even number of 1s. (d) The complement of { 11 , 111 } . (e) The binary encoding of numbers divisible by 5: { , , 00 , 000 , . . . } { , 101 , 1010 , 1111 , 10100 , . . . } . 1...
View
Full
Document
 Spring '10
 mr.

Click to edit the document details