State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: State complexity of the set of synchronizing words for circular automata and automata over binary alphabets |
scientific article; zbMATH DE number 7405997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of the set of synchronizing words for circular automata and automata over binary alphabets |
scientific article; zbMATH DE number 7405997 |
Statements
State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (English)
0 references
4 October 2021
0 references
finite automata
0 references
synchronization
0 references
completely reachable automata
0 references
state complexity
0 references
set of synchronizing words
0 references
0 references
0.8843803
0 references
0.88436675
0 references
0.88070655
0 references
0.87279874
0 references
0.8726015
0 references
0.8681421
0 references
0.8681421
0 references
0.86782944
0 references
0.86782944
0 references
0.86614215
0 references
