Reset sequences for monotonic automata
SIAM Journal on Computing
Directable nondeterministic automata
Acta Cybernetica
Compositions over a finite domain: from completeness to synchronizable automata
A half-century of automata theory
Composition Sequences for Functions over a Finite Domain
Composition Sequences for Functions over a Finite Domain
Synchronizing generalized monotonic automata
Theoretical Computer Science - Insightful theory
| Hi-index | 0.00 |
In spite of its simple formulation, the problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the general framework of a composition theory for functions over a finite domain N with n elements. The notion of depth introduced in this connection is a good indication of the complexity of a given function, namely, the complexity with respect to the length of composition sequences in terms of functions belonging to a basic set. Our results show that the depth may vary considerably with the target function. We also establish criteria about the reachability of some target functions, notably constants. Properties of n such as primality or being a power of 2 turn out to be important, independently of the semantic interpretation. Most of the questions about depth, as well as about the comparison of different notions of depth, remain open. Our results show that the study of functions of several variables may shed light also to the case where all functions considered are unary.