Python

4. dfa.py: Write a program that reads a description of a deterministic finite automaton (DFA) and then classifies input strings as accepted or rejected by the DFA DFAs are characterized by the following 5-tuple: (Q.. .qo, F), where Q denotes the set of states, is the alphabet of possible input symbols, is the set of transition rules, o is the start state, and F is the set of final (accepting) states. Input to the program will be a DFA specification followed by a number of input strings. For each input string, you should print "accepted" or "rejected". Example DFA 91 start0 93 Corresponding input, including input test strings: states: q0 svmbols: a b c begin_rules 0 -> q1 on a q1- q2 on b oq2 on c 1 - q1 on a end_rules start: g0 final: q2 q3 ab cba # prints "rejected" aaa #prints "rejected" aaab # prints "accepted" # prints "accepted