This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. Yu. Romanovskii, “Equivalence problem for real-time strict deterministic PD-automata,” Kibernetika, No. 5, 49–59 (1980).
M. Oyamaguchi, Y. Inagaki, and N. Honda, “The equivalence problem for real-time strict deterministic languages,” Inf. Control,45, No. 1, 90–115 (1980).
L. G. Valiant, “Decision procedures for families of deterministic pushdown automata,” Report Univ. Warwick Comput. Center, No. 7, 41–58 (1973).
A. V. Aho, “Nested stack automata,” JACM,16, No. 3, 383–406 (1969).
L. G. Valiant, “The equivalence problem for deterministic finite-turn pushdown automata,” Inf. Control,25, No. 2, 123–133 (1974).
Additional information
Translated from Kibernetika, No. 2, pp. 13–23, March–April, 1986.
Rights and permissions
About this article
Cite this article
Romanovskii, V.Y. The equivalence problem for real-time deterministic pushdown automata. Cybern Syst Anal 22, 162–175 (1986). https://doi.org/10.1007/BF01074776
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01074776