NAME ____________________________________________

CS 420/520 Theory of Computation, Spring 2019 at Indiana State University, taught by Jeff Kinne
Quiz 3 - Sipser chapter DFAs, NFAs, REs

Points - each part is graded as 1 point, half credit is possible.

1) Write a DFA for the language {string of a's and b's with at least 2 b's and at most 2 a's}












2) Let the letters have the following means: n for 5 cent nickel, d for 10 cent dime, q for 25 cent quarter.
   Write a DFA or NFA for the language {sequence of coins that add up to 30 cents}
   Note - not graded.















3) Write a DFA or NFA for the language {strings of 0's and 1's that either contains 000 or 111 within the string}










4) Write a DFA for the language {binary strings that are multiples of 2}












5) Write an NFA for the language {strings of a's, b's, and c's that is some number of a's followed by some number of b's followed by some number of c's}
   The "some number" can be any non-negative integer and can be different for the three different parts of the string.













6) Write a RE for the language from #5.












7) Write a RE for the language from #3.