Write a class for DFA type objects. Deterministic Finite Automata are commonly defined as aquintuple consisting of a set of states, a set of symbals, a transition function, a start state and a setof accept states. See the 051320anotes.pdf file on canvas. For this implementation let the alphabetbe given as a string of symbols, the transition function as list of lists which represent an n by mmatrix where the n rows represent the states and the m columnsrepresent the alphabet symbols,and the accept states as a set. The states are integers 0, 1, 2,..., n-1 and 0 is the start state. Theinput tape is a string of symbols from the alphabet. Submit your work as a Colab ipynb file tocanvas by the due date.

Solved
Show answers

Ask an AI advisor a question