inclusion_dfa_trick (359B)
1 # Inclusion DFA trick 2 3 In [automaton_inclusion] problems, the left-hand-side automaton can be transformed into a [DFA] by distinguishing every transition, up to modifying the right-hand-side automaton to create parallel transitions: this does not break [unambiguity] for instance 4 5 source: https://cstheory.stackexchange.com/a/34739 6 7 Up: [automaton_inclusion]