Tree adjunct grammars
- 1 February 1975
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 10 (1), 136-163
- https://doi.org/10.1016/s0022-0000(75)80019-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- String adjunct grammars: II. Equational representation, null symbols, and linguistic relevanceInformation and Control, 1972
- String adjunct grammars: I. Local and distributed adjunctionInformation and Control, 1972
- Some results in tree automataTheory of Computing Systems, 1972
- Mappings and grammars on treesTheory of Computing Systems, 1970
- Generalized2 sequential machine mapsJournal of Computer and System Sciences, 1970
- Tree generating regular systemsInformation and Control, 1969
- Indexed Grammars—An Extension of Context-Free GrammarsJournal of the ACM, 1968
- A helpful result for proving inherent ambiguityTheory of Computing Systems, 1968
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theoryJournal of Computer and System Sciences, 1967
- On Context-Free LanguagesJournal of the ACM, 1966