Recitation 2: Dfas and Nfas: February 10, 2005
Recitation 2: Dfas and Nfas: February 10, 2005
Recitation 2: Dfas and Nfas: February 10, 2005
Nancy Lynch
7. Epsilon Transition
8. Sipser page 36,40. A machine can accept many strings, but only a single language. To avoid confusion,
we will usually say a machine accepts a string and recognizes a language.
Problem 3:
:
1. Create DFAs for each of the following languages over the alphabet 89 6 .
(i) The language of strings that contain both a 0 and a 1.
(ii) The language of strings that contain 0110 and end in 1.
(iii) The language of strings that do not contain an odd number of 1s.
Problem 4: Let A ( BC,D is a binary number divisible by EF6 . Show that for each E , the language A ( is
regular. (Assume for simplicity that the string represented by is divisible by E for any E ).
Problem 5: Let be any language. Prove that HGH if and only if is in .
Problem 6: What language does the following automaton recognize ? Prove that the automaton indeed
recognizes the language you think it recognizes. To do this, we will need to prove that our FA (1) accepts all
strings in and (2) does not accept any string not in .
0 0
1 1
a b c