Second-order abstract categorial grammars as hyperedge replacement grammars

DOI10.1007/s10849-009-9109-6zbMath1204.68113OpenAlexW2096625683MaRDI QIDQ972434

Makoto Kanazawa

Publication date: 26 May 2010

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-009-9109-6

zbMATH Keywords

tree languageabstract categorial grammarhyperedge replacement grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Multiple context-free tree grammars: lexicalization and characterization ⋮ Unnamed Item ⋮ Hypergraph Lambek grammars ⋮ Powerful and NP-complete: hypergraph Lambek grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• Lectures on the Curry-Howard isomorphism
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• The string generating power of context-free hypergraph grammars
• On multiple context-free grammars
• IO and OI. I
• Rational tree relations
• On the expressive power of abstract categorial grammars: Representing context-free formalisms
• The complexity of graph languages generated by hyperedge replacement
• Closure properties of linear context-free tree languages with an application to optimality theory
• Graph expressions and graph rewritings
• Abstract Families of Abstract Categorial Languages
• Mappings and grammars on trees
• Logical Aspects of Computational Linguistics

This page was built for publication: Second-order abstract categorial grammars as hyperedge replacement grammars