Characterizations of stack uniform strict deterministic languages
Kybernetika (1981)
- Volume: 17, Issue: 3, page 209-221
- ISSN: 0023-5954
Access Full Article
topHow to cite
topReferences
top- A. V. Aho J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Vols. I, II. Prentice Hall, Englewood Cliffs, N. J. 1972, 1973. (1972)
- E. P. Friedman, The inclusion problem for simple languages, Theoretical Computer Science 7 (1976), 297-316. (1976) Zbl0349.68032MR0405936
- J. N. Gray M. A. Harrison, On the covering and reduction problems for context-free grammars, J. ACM 19 (1972), 675-698. (1972) MR0359410
- M. A. Harrison I. M. Havel, Strict deterministic grammars, Journal of Computer and System Sciences 7 (1973), 237-277. (1973) MR0319415
- M. A. Harrison I. M. Havel, Real-time strict deterministic languages, SIAM Journal on Computing 1 (1972), 333-349. (1972) MR0323164
- A. J. Korenjak J. E. Hopcroft, Simple deterministic languages, IEEE Conference Record of the 7th Annual Symposium on Switching and Automata Theory (1966), 36 - 46. (1966)
- M. Linna, Two decidability results for deterministic pushdown automata, Journal of Computer and System Sciences 18 (1979), 92-107. (1979) Zbl0399.03023MR0525833
- R. McNaughton, Parenthesis grammars, J. ACM 14 (1967), 490-500. (1967) Zbl0168.01206MR0234781
- M. Oyamaguchi N. Honda Y. Inagaki, The equivalence problem for real-time strict deterministic languages, Information and Control 45 (1980), 90-115. (1980) MR0582147
- J. Pittl, On two subclasses of real-time grammars, Mathematical Foundations of Computer Science 1978 (J. Winkowski, ed.). Lecture Notes in Computer Science 64, Springer-Verlag, Berlin 1978, 426-435. (1978) Zbl0389.68041MR0519859
- L. G. Valiant, Decision Problems for Families of Deterministic Pushdown Automata, University of Warwick, Computer Centre, Report No. 7, 1973. (1973)