Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:57, 10 July 2024
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
