Description

1. Use the PySimpleAutomata-software to write a program that takes as input a transition table for a DFA or NFA A, and outputs the transition diagram for A. For example, the input could be the automaton A =({q0,q1,q2},{0,1},δ,q0,{q2}) that has transition table

→ q0 {q0,q1} {q0}
q1 ∅ {q2}
⋆q2 ∅ ∅
The automaton A as a transition diagram:

∅ ∅ ∅
→{q0} {q0,q1} {q0}
{q1} ∅ {q }
⋆{q2} ∅ ∅
{q0,q1} {q0,q1} {q0,q2}
⋆{q0,q2} {q0,q1} {q0}
⋆{q1,q2} ∅ {q2}
⋆{q0,q1,q2} {q0,q1} {q0,q2}

Input/Output format
Use of libraries and some built-in python functions
• Any other function, whether built-in or not, that directly simplifies the assignment is not allowed.
What to submit
Using the Moodle system, submit a .zip file that includes:
1. Source code.
2. A .pdf file, explaining your format and how to run your code in few lines.
The format to be followed for submission file is :
<yourname> passign3 <student-id>.zip
How to prepare for the demo
1. Correctness of the program : 20%
2. Valid input and output cases passed : 40%
3. Comprehension of the written program : 30%
4. Understanding of the problem statement 10%