Slowly synchronizing automata with fixed alphabet size
From MaRDI portal
Publication:2042724
DOI10.1016/j.ic.2020.104614zbMath1497.68258arXiv1609.06853OpenAlexW3048326796MaRDI QIDQ2042724
Michiel de Bondt, Hans Zantema, Henk Don
Publication date: 21 July 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.06853
Related Items (2)
Special issue: Selected papers of the 11th international conference on language and automata theory and applications, LATA 2017 ⋮ Extremal synchronizing circular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Černý conjecture and 1-contracting automata
- Primitive digraphs with large exponents and slowly synchronizing automata
- The Černý conjecture for one-cluster automata with prime length cycle
- Synchronizing automata with a letter of deficiency 2
- An extremal problem for two families of sets
- Approximating the minimum length of synchronizing words is hard
- DFAs and PFAs with long shortest synchronizing word length
- Experiments with Synchronizing Automata
- Synchronizing Automata with Extremal Properties
- 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
- Attainable Values of Reset Thresholds
- Generating Small Automata and the Černý Conjecture
- Lower Bounds for Synchronizing Word Lengths in Partial Automata
- Finding DFAs with Maximal Shortest Synchronizing Word Length
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
This page was built for publication: Slowly synchronizing automata with fixed alphabet size
