A characterization of completely reachable automata (Q1622956): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:29, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of completely reachable automata |
scientific article |
Statements
A characterization of completely reachable automata (English)
0 references
22 November 2018
0 references
deterministic finite automaton
0 references
complete reachability
0 references
