Irredundant algorithms for traversing directed graphs: The deterministic case

DOI10.1023/A:1025733107700MaRDI QIDQ2487103zbMATH OpenOpenAlexFDO

Authors Yanyan Li, I. B. Bourdonov, A. S. Kossatchev, V. V. Kuliamin

Publication date 17 August 2005

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1025733107700

zbMATH Keywords

deterministic finite automata

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 3911721
• Traversal of an unknown directed graph by a finite robot
• Backtracking problem in the traversal of an unknown directed graph by a finite robot
• Time-space tradeoffs for undirected graph traversal by graph automata
• scientific article; zbMATH DE number 3914345

Cited in

(3)

• Projecting transition systems: overcoming state explosion in concurrent system verification
• Typical paths of a graph
• Can One Escape Red Chains?

This page was built for publication: Irredundant algorithms for traversing directed graphs: The deterministic case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487103)