Decidability of the equivalence problem for synchronous deterministic pushdown automata

  • A.Sh. Nepomnjashchaja
Part of the Lecture Notes in Computer Science book series (LNCS, volume 176)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Friedman E.P. Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes. — J.Comput.Syst.Sci., 1977, v.14, No 3.Google Scholar
  2. 2.
    Oyamaguchi M., Honda N., Inagaki Y. The Equivalence Problem for Real-Time DPDA. — Inform. Contr., 1980, v.45, No 1.Google Scholar
  3. 3.
    Romanovskij V.U. The Equivalence Problem for Strict Deterministic Pushdown Automata Working in Real-Time. — Kibernetica, 1980, No 5 (in Russian).Google Scholar
  4. 4.
    Valiant L.G. The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata. — Inform.Contr., 1974, v.25, No 2.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    Valiant L.G. Decision Procedures for Families of Deterministic Pushdown Automata. — Department of Computer Science, University of Warwick, Coventry, England. (A dissertation). July 1973.Google Scholar
  7. 7.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • A.Sh. Nepomnjashchaja
    • 1
  1. 1.Computing CenterSiberian Division USSR Academy of SciencesNovosibirskUSSR

Personalised recommendations