Completely Reachable Automata (Q2829965): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:56, 3 February 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
