On branching and looping. I

DOI10.1016/0304-3975(80)90014-6zbMATH Open0423.68036OpenAlexW4212796492MaRDI QIDQ1134530FDOQ1134530

Ivan 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

branchingiterationgame playingrobot planningloopingcomputing theoryfinite branching automatonfurcation

Mathematics Subject Classification ID

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

Cites Work

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

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

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