Generating small automata and the Černý conjecture
From MaRDI portal
Publication:5327508
Recommendations
- Experiments with Synchronizing Automata
- The Černý conjecture for automata respecting intervals of a directed graph
- scientific article; zbMATH DE number 1206597
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
- Strongly connected synchronizing automata and the language of minimal reset words
Cited in
(19)- On the Number of Synchronizing Colorings of Digraphs
- scientific article; zbMATH DE number 5593050 (Why is no real title available?)
- Small Generating Sets and DLPC Problem
- scientific article; zbMATH DE number 7298596 (Why is no real title available?)
- Small model property reflects in games and automata
- Slowly synchronizing automata with fixed alphabet size
- Checking whether an automaton is monotonic is NP-complete
- Large aperiodic semigroups
- Cerny's conjecture for automata with simple idempotents
- Syntactic complexity of suffix-free languages
- Černý's conjecture and the road colouring problem
- The Černý conjecture for one-cluster automata with prime length cycle
- Computing the shortest reset words of synchronizing automata
- Experiments with Synchronizing Automata
- Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata
- An extremal series of Eulerian synchronizing automata
- On the interplay between Černý and Babai's conjectures
- The averaging trick and the Černý conjecture
- The averaging trick and the Černý conjecture
This page was built for publication: Generating small automata and the Černý conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327508)