minimal automaton

minimal automaton

(theory)
An automaton possessing with redundant states.
References in periodicals archive ?
To get a feeling, let us have a look at the following concrete example: We construct a minimal automaton forbidding the subwords [10.sup.n]1 for all 1 [less than or equal to] n < 15.
The resulting minimal automaton M has 16 states; its creation out of A is not time-critical.
Full browser ?