Completely reachable automata: a polynomial algorithm and quadratic upper bounds (Q6638061)
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: a polynomial algorithm and quadratic upper bounds |
scientific article; zbMATH DE number 7944097
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completely reachable automata: a polynomial algorithm and quadratic upper bounds |
scientific article; zbMATH DE number 7944097 |
Statements
Completely reachable automata: a polynomial algorithm and quadratic upper bounds (English)
0 references
14 November 2024
0 references
Černý conjecture
0 references
complete reachability
0 references
DFA
0 references
extending word
0 references
reachability
0 references
reset threshold
0 references
reset word
0 references
simple idempotent
0 references
synchronizing automaton
0 references
synchronizing word
0 references
