State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
From MaRDI portal
Publication:2232292
DOI10.1007/978-3-030-68195-1_25OpenAlexW3133699300MaRDI QIDQ2232292FDOQ2232292
Authors: Stefan Hoffmann 
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/2011.14404
Recommendations
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
- The state complexity of alternating automata
- Completely distinguishable automata and the set of synchronizing words
- The state complexity of permutations on finite languages over binary alphabets
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Synchronizing automata over nested words
- Synchronizing automata over nested words
- State complexity of partial word finite automata
synchronizationfinite automatastate complexityset of synchronizing wordscompletely reachable automata
Cites Work
- Title not available (Why is that?)
- Synchronizing Automata and the Černý Conjecture
- The Černý conjecture and 1-contracting automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Slowly synchronizing automata and digraphs
- Primitive digraphs with large exponents and slowly synchronizing automata
- A characterization of completely reachable automata
- Les automates circulaires biaisés vérifient la conjecture de Černý
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
- Reset complexity of ideal languages over a binary alphabet
- Completely Reachable Automata
- Reset Complexity of Ideal Languages Over a Binary Alphabet
- Title not available (Why is that?)
Cited In (7)
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
- Reset complexity and completely reachable automata with simple idempotents
- Sync-maximal permutation groups equal primitive permutation groups
- Binary and circular automata having maximal state complexity for the set of synchronizing words
- New characterizations of primitive permutation groups with applications to synchronizing automata
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Completely distinguishable automata and the set of synchronizing words
This page was built for publication: State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232292)
