On the transition reduction problem for finite automata
Abstract
We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language L(En) denoted by the regular expression En=(1+)... (2+)... (3+)... (n+). These results can be used in the general case of the transition reduction problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.