An Extremal Series of Eulerian Synchronizing Automata
From MaRDI portal
Publication:2817403
DOI10.1007/978-3-662-53132-7_31zbMath1362.68156arXiv1604.02879OpenAlexW3102686480MaRDI QIDQ2817403
Publication date: 30 August 2016
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.02879
Related Items (3)
Unnamed Item ⋮ Černý's conjecture and the road colouring problem ⋮ Attainable Values of Reset Thresholds
Cites Work
- Unnamed Item
- Unnamed Item
- Primitive digraphs with large exponents and slowly synchronizing automata
- The Černý conjecture for one-cluster automata with prime length cycle
- Shortest synchronizing strings for Huffman codes
- Synchronizing automata preserving a chain of partial orders
- Strongly transitive automata and the Černý conjecture
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- Algebraic synchronization criterion and computing reset words
- Computing the shortest reset words of synchronizing automata
- Experiments with Synchronizing Automata
- LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA
- THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE
- Synchronizing Automata with Extremal Properties
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
- Reset Thresholds of Automata with Two Cycle Lengths
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- Slowly Synchronizing Automata and Digraphs
- On two Combinatorial Problems Arising from Automata Theory
- Generating Small Automata and the Černý Conjecture
- SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA
- Estimation of the length of reset words for automata with simple idempotents
This page was built for publication: An Extremal Series of Eulerian Synchronizing Automata
