Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- 31 December 1967
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 1 (4) , 317-322
- https://doi.org/10.1016/s0022-0000(67)80022-9
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Bracketed context-free languagesJournal of Computer and System Sciences, 1967
- On certain formal properties of grammarsInformation and Control, 1959