Journal ArticleDOI
On the Height of a Finite Automaton
TLDR
This work has shown the order of the states of a finite automaton is shown to be graduated, and the well-known Cerny problem on the minimal length of reset words can be formulated in terms of global height.Abstract:
The states of a finite automaton are ordered by height. This order is shown to be graduated, and the well-known Cerny problem on the minimal length of reset words can be formulated in terms of global height. The problem is proved for automata with four states.read more
References
More filters
Journal ArticleDOI
Representations of Regular Ideals in Finite Automata
TL;DR: The class of kernel ideals is invariant under the action of several automata functors and is shown to be equal to the class of zero ideals as discussed by the authors, which is a special case of regular ideals.