Synchronizing Automata Preserving a Chain of Partial Orders

DOI10.1007/978-3-540-76336-9_5zbMath1139.68377OpenAlexW2096850077MaRDI QIDQ3503892

Mikhail V. Volkov

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

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

zbMATH Keywords

deterministic finite automatonČerný conjecturestrongly connected automatonsynchronizing automatoncongruence on an automatonweakly monotonic automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

The annulation threshold for partially monotonic automata ⋮ Synchronizing sequences for road colored digraphs ⋮ Unnamed Item ⋮ Synchronizing Automata and the Černý Conjecture ⋮ Synchronization ⋮ Černý conjecture for edge-colored digraphs with few junctions ⋮ A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orienting polygonal parts without sensors
• An extremal problem for two families of sets
• Reset words for commutative and solvable automata
• Synchronizing generalized monotonic automata
• Composition sequences for functions over a finite domain.
• Reset Sequences for Monotonic Automata
• On two Combinatorial Problems Arising from Automata Theory
• RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
• Developments in Language Theory

This page was built for publication: Synchronizing Automata Preserving a Chain of Partial Orders