Equivalence between AND/OR graphs and context-free grammars

DOI10.1145/362280.362302zbMath0268.68034OpenAlexW2055558268MaRDI QIDQ5685655

Patrick A. V. Hall

Publication date: 1973

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362280.362302

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A general heuristic bottom-up procedure for searching AND/OR graphs ⋮ Concurrent competitive wave approach to hyper-distributed hyper-parallel AI processing ⋮ Generalized AND/OR graphs