This is a preview of subscription content, log in via an institution to check access.
Literature Cited
S. Ginsburg and S. Greibach, “Deterministic context-free languages,” Inf. Control.,9, No. 6, 620–648 (1966).
A. Korenjak and J. Hopcroft, “Simple deterministic languages” in: Languages and Automata [Russian translation], Mir, Moscow (1975), pp. 71–96.
R. McNaughton, “Parenthesis grammars,” J. ACM,14, No. 3, 490–500 (1967).
D. Rosenkrantz and R. E. Stearns, “Properties of deterministic top-down grammars,” Inf. Control. No. 3, 226–256 (1970).
L. G. Valiant, Decision Procedures for Families of Deterministic Pushdown Automata, Report No. 7, Univ. of Warwick Computer Center (1973).
L. G. Valiant, “The equivalence problem for deterministic finite-turn pushdown automata,” Inf. Control,25, No. 2, 123–133 (1974).
L. G. Valiant and M. S. Paterson, “Deterministic one-counter automata,” J. Comput. Syst. Sci.,10, No. 3, 340–350 (1975).
K. Taniguchi and T. Kasami, “A result on the equivalence problem for deterministic pushdown automata,” J. Comput. Syst. Sci.,13, No. 1, 38–50 (1976).
A. V. Anisimov, “Syntactic properties of recursive program schemata,” Kibernetika, No. 3, 51–59 (1977).
V. V. Zubenko, “On finite-turn pushdown automata,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 3, 838–841 (1978).
M. Linna, “Two decidability results for deterministic pushdown automata,” Lecture Notes in Computer Science,53, 365–373 (1977).
M. Oyamaguchi and N. Honda, “The decidability of equivalence for deterministic stateless pushdown automata, Inf. Control,38, No. 3, 367–376 (1978).
E. P. Friedman and S. A. Greibach, “Superdeterministic DPDAs: the method of accepting does affect decision problems,” J. Comput. Syst. Sci.,19, No. 1, 79–117 (1979).
M. A. Harrison and I. M. Havel, “Strict deterministic grammars,” J. Comput. Syst. Sci.,7, No. 3, 237–277 (1973).
M. A. Harrison and I. M. Havel, “Real time strict deterministic languages,” SIAM J. Comput.,1, No. 4, 333–349 (1972).
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).
A. V. Anisimov, “Some subclasses of deterministic context-free languages,” Kibernetika, No. 4, 64–67 (1973).
E. P. Friedman, “Equivalence problems for deterministic context-free languages and monadic recursion schemes,” J. Comput. Syst. Sci.,14, No. 3, 344–359 (1977).
E. Ashcroft, Z. Manna, and A. Pnueli, “Decidable properties of single-argument functional schemes,” in: Languages and Automata [Russian translation], Mir, Moscow (1975), pp. 97–108.
A. V. Anisimov, “Formal grammars using external terminal contexts,” Kibernetika, No. 3, 81–88 (1974).
M. Oyamaguchi, N. Honda, and Y. Inagagi, Inf. Control45, No. 1, 90–115 (1980).
Additional information
Translated from Kibernetika, No. 5, pp. 49–59, September–October, 1980.
Rights and permissions
About this article
Cite this article
Romanovskii, V.Y. Equivalence problem for real-time strict deterministic pushdown automata. Cybern Syst Anal 16, 689–700 (1980). https://doi.org/10.1007/BF01078498
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01078498