Equivalence between two automata (DFA)
This program determines whether two finite automata A and B recognize the same language.
Input for a DFA:
Number of States
States
Nr letters
letter
initial State
Nr final states
final states
Nr transitions
transitions
Example:
3
1 2 3
2
a b
1
2
2 3
3
1 a 2
2 b 2
2 a 3