Completely Reachable Automata (Q2829965)
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 |
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
