Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words (Q6345307)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words |
scientific article |
Statements
17 July 2020
0 references
cs.FL
0 references
math.GR
0 references
