The decidability of equivalence for a family of linear grammars
Open Access
- 30 November 1980
- journal article
- Published by Elsevier in Information and Control
- Vol. 47 (2) , 122-136
- https://doi.org/10.1016/s0019-9958(80)90741-x
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Linear Languages and the Intersection Closures of Classes of LanguagesSIAM Journal on Computing, 1978
- The structure of context-free grammatical familiesJournal of Computer and System Sciences, 1977
- An Observation on Relative Parsing TimeJournal of the ACM, 1975
- Context-free grammar formsJournal of Computer and System Sciences, 1975
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Deterministic context free languagesInformation and Control, 1966
- Generalizations of regular eventsInformation and Control, 1965
- On a family of linear grammarsInformation and Control, 1964
- The undecidability of the ambiguity problem for minimal linear grammarsInformation and Control, 1963
- On certain formal properties of grammarsInformation and Control, 1959