Tree adjunct grammars
type: Item
instance of: scholarly article
title: Tree adjunct grammars
zbMATH Open document ID: 0326.68053
DOI: 10.1016/S0022-0000(75)80019-5
author: Aravind K. Joshi
author: Leon S. Levy
author: Masako Takahashi
published in: Journal of Computer and System Sciences
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3511611
MaRDI profile type: Publication
cites work: Indexed Grammars—An Extension of Context-Free Grammars
cites work: Q5542103
cites work: Tree generating regular systems
cites work: Q5590809
cites work: String adjunct grammars: II. Equational representation, null symbols, and linguistic relevance
cites work: Q5663376
cites work: A helpful result for proving inherent ambiguity
cites work: On Context-Free Languages
cites work: Mappings and grammars on trees
cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
cites work: Generalized sequential machine maps
full work available at URL: s0022-0000(75)80019-5
OpenAlex ID: W2130630493
description: scientific article; zbMATH DE number 3511611