On containment problems for finite-turn languages

  • Yair Itzhaik
  • Amiram Yehudai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


Equivalence Problem Regular Language Input Symbol Linearity Test Input Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B]
    C. Beeri, An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata, TCS 3(1976), 305–320.Google Scholar
  2. [C]
    B. Courcelle, On Jump Deterministic Pushdown Automato, Math Systems Theorey (1977), 87–109.Google Scholar
  3. [F]
    E.P.Friedman, Equivalence problems for deterministic cfl and monadic recursion schemes JCSS 14 (1977).Google Scholar
  4. [FG]
    E.P. Friedman and S.A. Greibach, On equivalence and subclass containment problems ofr deterministic context-free languages, Info. Let. 7(1978), 287–290.CrossRefGoogle Scholar
  5. [Gl]
    S.A. Greibach, Linearity is polynomially decidable for realtime pushdown store automata, Information and Control, 42(1979), 27–37.Google Scholar
  6. [G2]
    S.A. Greibach, Jump PDA's and Hierarchies of Context-free languages, SIAM Journal on Computing 3 (1974), 111–127.CrossRefGoogle Scholar
  7. [GF]
    S.A Greibach and E.P. Friedman, Some results on the extended equivalence Problem for dpda's.manuscript 1979.Google Scholar
  8. [GG]
    S. Ginsburg and S.A. Greibach, Deterministic context-free languages, Information and Control 9(1966), 602–648.Google Scholar
  9. [I]
    Y.Itzhaik, Deterministic pushdown automata, Master Thesis, Technion, IIT, June 1978,-(In Hebrew).Google Scholar
  10. [IY1]
    Y.Itzhaik and A. Yehudai, A decision procedure for the euqivalence of two dpta's one of which is linear, proceedings of ICALP 8I, Acre, Lecture Notes in Computer Science No. 115, (1981) Springer-Verlag, 229–237.Google Scholar
  11. [IY2]
    Y. Itzhaik and A. Yehudai, Checking dterministic languages for the real time strict property, Technical Report, Tel-Aviv University, (1982).Google Scholar
  12. [IY3]
    Y. Itzahik and A. Yehudai, New families of non real-time dpta's and their decidability results, Accepted to Theoretical Computer Science, 1983.Google Scholar
  13. [KH]
    A.J. Korenjak and J.E. Hopcroft, Simple Deterministic languages, IEEE 7th Symp. on Switching and Automata Theory Berkeley, California, (1966).Google Scholar
  14. [LP]
    M. Linna and M.Penttonen, New Proofs for jump dpda's, Math Foundations of Computer Science (1979), 354–362.Google Scholar
  15. [OH]
    M. Oyamaguchi and N. Honda, The decidability of equivalence for deterministic stateless pushdown Automata, Information and Control 38(1978), 367–376.Google Scholar
  16. [OIH1]
    M. Oyamaguchi, Y. inagaki and N. Honda, A real-time strictness test for deterministic pushdown automata, Inform. Contr. 47(1980) 1–9.Google Scholar
  17. [OIH2]
    M. Oyamaguchi, Y. Inagaki and N. Honda, The equivalence problem for two dpda's one which is a finite-turn or one counter machine, JCSS 23(1981) 366–382.Google Scholar
  18. [OIH3]
    M.Oyamaguchi, Y. Inagaki and N. Honda, On the equivalence problem for two dpda's, one of which is real-time, in "Proceedings IFIP Congress 80, 1980", pp. 52–57.Google Scholar
  19. [RS]
    D.J. Rosenkrantz and R.E. Stearns, Properties of deterministic top-down grammars, Information and Control 17(1970), 226–255.CrossRefGoogle Scholar
  20. [S]
    R.E. Stearns, A regularity test for pushdown machines, Inform. Contr. 11(1967), 323–340CrossRefGoogle Scholar
  21. [TK]
    K. Taniguchi and T. Kasami, A result on the equivalence problem for deterministic pushdown automata, J. Comp. System Sci. 13(1976), 38–50.Google Scholar
  22. [U]
    E. Ukkonen, The equivalence problem for some non-real-time deterministic pushdown automata, Proceedings of the 12th STOC Conference (1980) 29–38, also JACM 29 (1982), 1166–1181.CrossRefGoogle Scholar
  23. [V1]
    L.G. Valinat, Regularity and related problems for deterministic pushdown automata, JACM 22 (1975), 1–10.CrossRefGoogle Scholar
  24. [V2]
    L.C. Valiant, The equivalence problem for deterministic finite-turn pushdown automata, Info. Contr. 25, (1974), 123–133.CrossRefGoogle Scholar
  25. [V3]
    L.G. Valiant, Decision procedures for families of deterministic pushdown automata, Ph.D. Dissertation, University of Warwick Computer Centre, Report No. 7, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Yair Itzhaik
    • 1
  • Amiram Yehudai
    • 2
  1. 1.Department of Computer ScienceTechnion — Israel Institute of TechnologyHaifaIsrael
  2. 2.Department of Computer Science, School of Mathematical SciencesTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations