Completely Reachable Automata (Q2829965): Difference between revisions
From MaRDI portal
Latest revision as of 21:20, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completely Reachable Automata |
scientific article |
Statements
Completely Reachable Automata (English)
0 references
9 November 2016
0 references
deterministic finite automaton
0 references
complete reachability
0 references
transition monoid
0 references
syntactic complexity
0 references
PSPACE-completeness
0 references
