Irredundant algorithms for traversing directed graphs: The deterministic case (Q2487103)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Irredundant algorithms for traversing directed graphs: The deterministic case |
scientific article |
Statements
Irredundant algorithms for traversing directed graphs: The deterministic case (English)
0 references
17 August 2005
0 references
deterministic finite automata
0 references
