Synchronizing automata with a letter of deficiency 2

DOI10.1016/J.TCS.2007.01.010zbMath1111.68050OpenAlexW2020844577MaRDI QIDQ880170

D. S. Ananichev, Yu. I. Zaks, Mikhail V. Volkov

Publication date: 11 May 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10995/72265

zbMATH Keywords

deterministic finite automatonreset wordČerný conjecturesynchronizing automatondeficiency of a transformation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

Shortest synchronizing strings for Huffman codes ⋮ THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE ⋮ P(l)aying for Synchronization ⋮ Synchronizing Automata of Bounded Rank ⋮ Reset Thresholds of Automata with Two Cycle Lengths ⋮ Primitive digraphs with large exponents and slowly synchronizing automata ⋮ Synchronizing random automata on a 4-letter alphabet ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ Slowly synchronizing automata with zero and noncomplete sets ⋮ Synchronizing Automata and the Černý Conjecture ⋮ Černý's conjecture and group representation theory ⋮ Shortest Synchronizing Strings for Huffman Codes ⋮ The Černý conjecture for one-cluster automata with prime length cycle ⋮ Experimental Study of the Shortest Reset Word of Random Automata ⋮ COMPAS - A Computing Package for Synchronization ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata ⋮ Matrix Mortality and the Černý-Pin Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orienting polygonal parts without sensors
• The range order of a product of i transformations from a finite full transformation semigroup
• An extremal problem for two families of sets
• Synchronizing finite automata on Eulerian digraphs.
• Synchronizing generalized monotonic automata
• Composition sequences for functions over a finite domain.
• Model-based testing of reactive systems. Advanced lectures.
• Reset Sequences for Monotonic Automata
• On two Combinatorial Problems Arising from Automata Theory
• An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture

This page was built for publication: Synchronizing automata with a letter of deficiency 2