Second-order abstract categorial grammars as hyperedge replacement grammars
type: Item
instance of: scholarly article
title: Second-order abstract categorial grammars as hyperedge replacement grammars
zbMATH Open document ID: 1204.68113
author: Makoto Kanazawa
published in: Journal of Logic, Language and Information
publication date: 2010-05-26T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5711945
zbMATH Keywords: abstract categorial grammar
zbMATH Keywords: hyperedge replacement grammar
zbMATH Keywords: tree language
MaRDI profile type: Publication
full work available at URL: s10849-009-9109-6
OpenAlex ID: W2096625683
cites work: Graph expressions and graph rewritings
cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars
cites work: On the expressive power of abstract categorial grammars: Representing context-free formalisms
cites work: The string generating power of context-free hypergraph grammars
cites work: Q4502802
cites work: IO and OI. I
cites work: Hyperedge replacement: grammars and languages
cites work: Q3774975
cites work: Q4346206
cites work: Abstract Families of Abstract Categorial Languages
cites work: Closure properties of linear context-free tree languages with an application to optimality theory
cites work: The complexity of graph languages generated by hyperedge replacement
cites work: A short introduction to intuitionistic logic
cites work: Rational tree relations
cites work: Mappings and grammars on trees
cites work: On multiple context-free grammars
cites work: Lectures on the Curry-Howard isomorphism
cites work: Logical Aspects of Computational Linguistics
DOI: 10.1007/S10849-009-9109-6
description: scientific article; zbMATH DE number 5711945