Synchronizing Automata of Bounded Rank

DOI10.1007/978-3-642-31606-7_15zbMath1297.68133OpenAlexW71470512MaRDI QIDQ2914705

Vladimir V. Gusev

Publication date: 20 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Constrained synchronization and subset synchronization problems for weakly acyclic automata ⋮ Computational complexity of synchronization under sparse regular constraints ⋮ Ideal separation and general theorems for constrained synchronization and their application to small constraint automata ⋮ Constrained synchronization and commutativity ⋮ Computational complexity of synchronization under regular commutative constraints ⋮ Semicomputable points in Euclidean spaces

Cites Work

• Synchronizing automata with a letter of deficiency 2
• Synchronizing finite automata on Eulerian digraphs.
• Pattern avoidance by palindromes
• A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
• Modifying the Upper Bound on the Length of Minimal Synchronizing Word
• Lower Bounds for the Length of Reset Words in Eulerian Automata
• Synchronizing Automata and the Černý Conjecture
• Slowly Synchronizing Automata and Digraphs
• Matrix Mortality and the Černý-Pin Conjecture
• On two Combinatorial Problems Arising from Automata Theory
• Estimation of the length of reset words for automata with simple idempotents
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronizing Automata of Bounded Rank