Second-order abstract categorial grammars as hyperedge replacement grammars
From MaRDI portal
Publication:972434
Recommendations
Cites work
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 1042221 (Why is no real title available?)
- scientific article; zbMATH DE number 1504824 (Why is no real title available?)
- A short introduction to intuitionistic logic
- Abstract families of abstract categorial languages
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Closure properties of linear context-free tree languages with an application to optimality theory
- Graph expressions and graph rewritings
- Hyperedge replacement: grammars and languages
- IO and OI. I
- Lectures on the Curry-Howard isomorphism
- Logical Aspects of Computational Linguistics
- Mappings and grammars on trees
- On multiple context-free grammars
- On the expressive power of abstract categorial grammars: Representing context-free formalisms
- Rational tree relations
- The complexity of graph languages generated by hyperedge replacement
- The string generating power of context-free hypergraph grammars
Cited in
(6)- scientific article; zbMATH DE number 7561694 (Why is no real title available?)
- Powerful and NP-complete: hypergraph Lambek grammars
- Abstract families of abstract categorial languages
- Hypergraph Lambek grammars
- Hypergraph basic categorial grammars
- Multiple context-free tree grammars: lexicalization and characterization
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)
