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; zbMATH DE number 6649500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completely reachable automata |
scientific article; zbMATH DE number 6649500 |
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
0 references
0.9072591066360474
0 references
0.7735172510147095
0 references
0.7708648443222046
0 references
0.7651765942573547
0 references
