2. Nondeterministic finite automaton

Deadline: 2022-03-01 24:00

• In the lab we studied the program automaton-01.py. The program automaton-p.py simulates the running of a simple non-deterministic finite automaton.
  1. Download the program and run it with the command

     python3 automaton.py word
     	

     where word is the word you want to recognize.

  2. The program uses the built-in set functions to keep records of the currently available states in the computing tree of the non-deterministic finite automaton.
  3. Draw the automaton and explain it with your own words: (1) how does the program simulate the operation of the automaton, (2) what language does the automaton recognize? (Please give your answer in a comment of your uploaded code. No need to attach a drawing.)
• Change the description of the automaton in the file automaton-p.py between the lines

  # START
  	

  and

  # STOP
  	

  so that the program accepts the words that contain even number of letters a or contain the string algp (or both)!

  So e.g. 'aaalgprbbb' and 'asdaefaa' are accepted but 'aaalgbb' is not.