Context-free grammars on trees

DOI10.1145/800169.805428zbMath1282.68151OpenAlexW2079113556MaRDI QIDQ5402512

William C. Rounds

Publication date: 14 March 2014

Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (7)

Unnamed Item ⋮ Combinatory categorial grammars as generators of weighted forests ⋮ Towards more precise rewriting approximations ⋮ Morphismes et bimorphismes d'arbres ⋮ The tree-generative capacity of combinatory categorial grammars ⋮ Tree-based picture generation ⋮ Pushdown tree automata, algebraic tree systems, and algebraic tree series

This page was built for publication: Context-free grammars on trees