Bulletin of the European Association for Theoretical Computer Science · 1992 · 45 citations · 1 references
ComputingComputer ScienceMathematicsAlgorithmsAutomata TheoryFinite AutomataFinite-state MachinesTuring MachinesFinite Automata TheoryNondeterministic Turing Machines
With every rational language we associate a canonical non-deterministic automaton, that subsumes all possible “minimal” automata recognizing this language.
1