Second-order abstract categorial grammars as hyperedge replacement grammars
From MaRDI portal
Publication:972434
DOI10.1007/S10849-009-9109-6zbMATH Open1204.68113OpenAlexW2096625683MaRDI QIDQ972434FDOQ972434
Authors: 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
Recommendations
Cites Work
- Hyperedge replacement: grammars and languages
- Lectures on the Curry-Howard isomorphism
- On multiple context-free grammars
- Title not available (Why is that?)
- Mappings and grammars on trees
- A short introduction to intuitionistic logic
- IO and OI. I
- Closure properties of linear context-free tree languages with an application to optimality theory
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Abstract families of abstract categorial languages
- Graph expressions and graph rewritings
- The complexity of graph languages generated by hyperedge replacement
- Title not available (Why is that?)
- On the expressive power of abstract categorial grammars: Representing context-free formalisms
- Rational tree relations
- The string generating power of context-free hypergraph grammars
- Title not available (Why is that?)
- Logical Aspects of Computational Linguistics
Cited In (6)
This page was built for publication: Second-order abstract categorial grammars as hyperedge replacement grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972434)
