This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Friedman E.P. Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes. — J.Comput.Syst.Sci., 1977, v.14, No 3.
Oyamaguchi M., Honda N., Inagaki Y. The Equivalence Problem for Real-Time DPDA. — Inform. Contr., 1980, v.45, No 1.
Romanovskij V.U. The Equivalence Problem for Strict Deterministic Pushdown Automata Working in Real-Time. — Kibernetica, 1980, No 5 (in Russian).
Valiant L.G. The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata. — Inform.Contr., 1974, v.25, No 2.
Oyamaguchi M., Honda N., Inagaki Y. The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. — J.Comput.Syst.Sci., 1981, v.23, No 3.
Valiant L.G. Decision Procedures for Families of Deterministic Pushdown Automata. — Department of Computer Science, University of Warwick, Coventry, England. (A dissertation). July 1973.
Nepomnjashchaja A.Sh. The Decidability of Equivalence Problem for the Union of S-Grammars. — In: Translation and Optimization of Programs. — Computing Center of the Siberian Division of the USSR Academy of Sciences, Novosibirsk, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nepomnjashchaja, A. (1984). Decidability of the equivalence problem for synchronous deterministic pushdown automata. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030325
Download citation
DOI: https://doi.org/10.1007/BFb0030325
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive