Synchronizing automata preserving a chain of partial orders

Authors:
Mikhail V. Volkov
Affiliations:
Department of Mathematics and Mechanics, Ural State University, Ekaterinburg, Russia
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 5
Cited 2

Reset sequences for monotonic automata

SIAM Journal on Computing
Composition sequences for functions over a finite domain

Theoretical Computer Science
Synchronizing generalized monotonic automata

Theoretical Computer Science - Insightful theory
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
The mortality threshold for partially monotonic automata

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Synchronization

Information and Computation
Synchronizing Automata and the Černý Conjecture

Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new class of automata which strictly contains the class of aperiodic automata and shares with the latter certain synchronization properties. In particular, every strongly connected automaton in this new class is synchronizing and has a reset word of length ⌊n(n+1)/6⌋ where n is the number of states of the automaton.