Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words (Q2232291)
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: Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words |
scientific article; zbMATH DE number 7405996
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words |
scientific article; zbMATH DE number 7405996 |
Statements
Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words (English)
0 references
4 October 2021
0 references
finite automata
0 references
synchronization
0 references
completely reachable automata
0 references
primitive permutation groups
0 references
state complexity
0 references
0.8918545
0 references
0.8843803
0 references
0.88091177
0 references
0 references
0.8753077
0 references
0 references
0.8713021
0 references
0.8654008
0 references
