COMP 494: Quiz 1 --- Friday, July 14, 2000

1. Carefully define what is a language:
   
   
   
   
   
   
   
   
2. Define (formally) what is a DFA M: it is a five-tuple M=
   where
   
   
   
   
   
   
   
3. Draw a DFA which accepts the language L = {x in {a,b}*: xhas at least three a's}. (The three a's don't have to be next to eachother.)
   
   
   
   
   
   
   
   
4. Simplify the following language (write it as simply as you can).
   ({a,aaaa}{aa,aaaaa} )*
   
   
   
   
   
   
   
   
5. True or false: there is one and only one finite lanugage that can be accepted by a 1-state DFA. Explain.