ON THE HEIGHT OF A FINITE AUTOMATON

    loading  Checking for direct PDF access through Ovid

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.

Related Topics

    loading  Loading Related Articles