State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | State complexity of the set of synchronizing words for circular automata and automata over binary alphabets |
scientific article |
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
