A characterization of completely reachable automata (Q1622956)
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: A characterization of completely reachable automata |
scientific article; zbMATH DE number 6983374
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of completely reachable automata |
scientific article; zbMATH DE number 6983374 |
Statements
A characterization of completely reachable automata (English)
0 references
22 November 2018
0 references
deterministic finite automaton
0 references
complete reachability
0 references
