Theory of computation
DFA to regex & product
Convert a DFA or NFA to a regular expression by state elimination, step by step, and build product automata for union, intersection and difference.
Theory of computation
Convert a DFA or NFA to a regular expression by state elimination, step by step, and build product automata for union, intersection and difference.