Geodesic
Characterizations of stack uniform strict deterministic languages
Kybernetika, Tome 17 (1981) no. 3, pp. 209-221 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68F10, 68Q45 
@article{KYB_1981_17_3_a0,
     author = {Pittl, Jan},
     title = {Characterizations of stack uniform strict deterministic languages},
     journal = {Kybernetika},
     pages = {209--221},
     year = {1981},
     volume = {17},
     number = {3},
     mrnumber = {628209},
     zbl = {0468.68090},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1981_17_3_a0/}
}
TY  - JOUR
AU  - Pittl, Jan
TI  - Characterizations of stack uniform strict deterministic languages
JO  - Kybernetika
PY  - 1981
SP  - 209
EP  - 221
VL  - 17
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/KYB_1981_17_3_a0/
LA  - en
ID  - KYB_1981_17_3_a0
ER  - 
%0 Journal Article
%A Pittl, Jan
%T Characterizations of stack uniform strict deterministic languages
%J Kybernetika
%D 1981
%P 209-221
%V 17
%N 3
%U http://geodesic.mathdoc.fr/item/KYB_1981_17_3_a0/
%G en
%F KYB_1981_17_3_a0
Pittl, Jan. Characterizations of stack uniform strict deterministic languages. Kybernetika, Tome 17 (1981) no. 3, pp. 209-221. http://geodesic.mathdoc.fr/item/KYB_1981_17_3_a0/

[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.

[2] E. P. Friedman: The inclusion problem for simple languages. Theoretical Computer Science 7 (1976), 297-316. | MR | Zbl

[3] J. N. Gray M. A. Harrison: On the covering and reduction problems for context-free grammars. J. ACM 19 (1972), 675-698. | MR

[4] M. A. Harrison I. M. Havel: Strict deterministic grammars. Journal of Computer and System Sciences 7 (1973), 237-277. | MR

[5] M. A. Harrison I. M. Havel: Real-time strict deterministic languages. SIAM Journal on Computing 1 (1972), 333-349. | MR

[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.

[7] M. Linna: Two decidability results for deterministic pushdown automata. Journal of Computer and System Sciences 18 (1979), 92-107. | MR | Zbl

[8] R. McNaughton: Parenthesis grammars. J. ACM 14 (1967), 490-500. | MR | Zbl

[9] M. Oyamaguchi N. Honda Y. Inagaki: The equivalence problem for real-time strict deterministic languages. Information and Control 45 (1980), 90-115. | MR

[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. | MR | Zbl

[11] L. G. Valiant: Decision Problems for Families of Deterministic Pushdown Automata. University of Warwick, Computer Centre, Report No. 7, 1973.