Extremal synchronizing circular automata
From MaRDI portal
Publication:2051843
DOI10.1016/j.ic.2021.104817OpenAlexW3211607772MaRDI QIDQ2051843
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104817
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive digraphs with large exponents and slowly synchronizing automata
- Synchronizing monotonic automata
- The Černý conjecture for one-cluster automata with prime length cycle
- Synchronizing automata preserving a chain of partial orders
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- Slowly synchronizing automata with fixed alphabet size
- DFAs and PFAs with long shortest synchronizing word length
- Experiments with Synchronizing Automata
- Synchronizing Automata with Extremal Properties
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- Attainable Values of Reset Thresholds
- 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: Extremal synchronizing circular automata
