On branching and looping. I

DOI10.1016/0304-3975(80)90014-6zbMath0423.68036OpenAlexW4212796492MaRDI QIDQ1134530

Ivan M. Havel

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90014-6

zbMATH Keywords

iterationbranchinggame playingrobot planningloopingcomputing theoryfinite branching automatonfurcation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Artificial intelligence (68T99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of computing (68Q99)

Cites Work

• A logical theory of robot problem solving
• Generalized AND/OR graphs
• A representation of trees by languages. I
• Algebraic linguistics; analytical models
• An admissible and optimal algorithm for searching AND/OR graphs
• On some operators reducing generalized grammars
• ON AN AUTOMATON WHICH RECOGNIZES A FAMILY OF AUTOMATA
• Solving Sequential Conditions by Finite-State Strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On branching and looping. I