Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405)
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: An Interplay Between Automata, Graphs, and Trees |
scientific article; zbMATH DE number 7749893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees |
scientific article; zbMATH DE number 7749893 |
Statements
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (English)
0 references
13 October 2023
0 references
deterministic finite automaton
0 references
complete reachability
0 references
strongly connected graph
0 references
tree
0 references
