Irredundant algorithms for traversing directed graphs: The deterministic case (Q2487103)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2194898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Irredundant algorithms for traversing directed graphs: The deterministic case |
scientific article; zbMATH DE number 2194898 |
Statements
Irredundant algorithms for traversing directed graphs: The deterministic case (English)
0 references
17 August 2005
0 references
deterministic finite automata
0 references
0.7295631170272827
0 references
0.717070460319519
0 references
0.7148413062095642
0 references
