Unformatted text preview: any other ﬁnite language. Problem 3. How many diﬀerent 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 0’s or an even number of 1’s. (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.
 Set Theory, Computational complexity theory, infinite unary language

Click to edit the document details