Class Work 4: Nondeterministic Finite Automata

Computer Science 416/685: Computability Theory
Lehman College, City University of New York
Fall 2016

Grading Notes:

• Submit one answer per group.
• Make sure that the answer is legible.
• Include the full names of all group members on your submitted work (so all get credit).

1. What is the language (strings accepted) by the following machine:
   
   (generated using the random FSM generator at http://ivanzuzak.info/noam/webapps/fsm_simulator/).
   
2. What is the language (strings accepted) by the following machine:
   
   (generated using the random FSM generator at http://ivanzuzak.info/noam/webapps/fsm_simulator/).