The Černý conjecture and 1-contracting automata
From MaRDI portal
Publication:311503
zbMath1350.68167arXiv1507.06070MaRDI QIDQ311503
Publication date: 13 September 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06070
Related Items (12)
Unnamed Item ⋮ Some results concerning careful synchronization of partial automata and subset synchronization of DFA's ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ Binary completely reachable automata ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ On the Interplay Between Černý and Babai’s Conjectures ⋮ Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words ⋮ State complexity of the set of synchronizing words for circular automata and automata over binary alphabets ⋮ Reset Complexity of Ideal Languages Over a Binary Alphabet ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ Reset complexity and completely reachable automata with simple idempotents
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Černý conjecture for one-cluster automata with prime length cycle
- Synchronizing automata preserving a chain of partial orders
- An extremal problem for two families of sets
- Synchronizing finite automata on Eulerian digraphs.
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- On two Combinatorial Problems Arising from Automata Theory
This page was built for publication: The Černý conjecture and 1-contracting automata
