Previous |  Up |  Next

Article

Title: Characterizations of stack uniform strict deterministic languages (English)
Author: Pittl, Jan
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 17
Issue: 3
Year: 1981
Pages: 209-221
.
Category: math
.
MSC: 68F10
MSC: 68Q45
idZBL: Zbl 0468.68090
idMR: MR628209
.
Date available: 2009-09-24T17:20:57Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/125427
.
Reference: [1] A. V. Aho J. D. Ullman: The Theory of Parsing, Translation, and Compiling.Vols. I, II. Prentice Hall, Englewood Cliffs, N. J. 1972, 1973.
Reference: [2] E. P. Friedman: The inclusion problem for simple languages.Theoretical Computer Science 7 (1976), 297-316. Zbl 0349.68032, MR 0405936
Reference: [3] J. N. Gray M. A. Harrison: On the covering and reduction problems for context-free grammars.J. ACM 19 (1972), 675-698. MR 0359410
Reference: [4] M. A. Harrison I. M. Havel: Strict deterministic grammars.Journal of Computer and System Sciences 7 (1973), 237-277. MR 0319415
Reference: [5] M. A. Harrison I. M. Havel: Real-time strict deterministic languages.SIAM Journal on Computing 1 (1972), 333-349. MR 0323164
Reference: [6] 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.
Reference: [7] M. Linna: Two decidability results for deterministic pushdown automata.Journal of Computer and System Sciences 18 (1979), 92-107. Zbl 0399.03023, MR 0525833
Reference: [8] R. McNaughton: Parenthesis grammars.J. ACM 14 (1967), 490-500. Zbl 0168.01206, MR 0234781
Reference: [9] M. Oyamaguchi N. Honda Y. Inagaki: The equivalence problem for real-time strict deterministic languages.Information and Control 45 (1980), 90-115. MR 0582147
Reference: [10] 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. Zbl 0389.68041, MR 0519859
Reference: [11] L. G. Valiant: Decision Problems for Families of Deterministic Pushdown Automata.University of Warwick, Computer Centre, Report No. 7, 1973.
.

Files

Files Size Format View
Kybernetika_17-1981-3_1.pdf 598.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo