Skip to main content
SpringerLink
Log in

On containment problems for finite-turn languages

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 158))

Included in the following conference series:

  • 135 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. B. Courcelle, On Jump Deterministic Pushdown Automato, Math Systems Theorey (1977), 87–109.

    Google Scholar 

  3. E.P.Friedman, Equivalence problems for deterministic cfl and monadic recursion schemes JCSS 14 (1977).

    Google Scholar 

  4. E.P. Friedman and S.A. Greibach, On equivalence and subclass containment problems ofr deterministic context-free languages, Info. Let. 7(1978), 287–290.

    Article  Google Scholar 

  5. S.A. Greibach, Linearity is polynomially decidable for realtime pushdown store automata, Information and Control, 42(1979), 27–37.

    Google Scholar 

  6. S.A. Greibach, Jump PDA's and Hierarchies of Context-free languages, SIAM Journal on Computing 3 (1974), 111–127.

    Article  Google Scholar 

  7. S.A Greibach and E.P. Friedman, Some results on the extended equivalence Problem for dpda's.manuscript 1979.

    Google Scholar 

  8. S. Ginsburg and S.A. Greibach, Deterministic context-free languages, Information and Control 9(1966), 602–648.

    Google Scholar 

  9. Y.Itzhaik, Deterministic pushdown automata, Master Thesis, Technion, IIT, June 1978,-(In Hebrew).

    Google Scholar 

  10. 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. Y. Itzhaik and A. Yehudai, Checking dterministic languages for the real time strict property, Technical Report, Tel-Aviv University, (1982).

    Google Scholar 

  12. 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. A.J. Korenjak and J.E. Hopcroft, Simple Deterministic languages, IEEE 7th Symp. on Switching and Automata Theory Berkeley, California, (1966).

    Google Scholar 

  14. M. Linna and M.Penttonen, New Proofs for jump dpda's, Math Foundations of Computer Science (1979), 354–362.

    Google Scholar 

  15. M. Oyamaguchi and N. Honda, The decidability of equivalence for deterministic stateless pushdown Automata, Information and Control 38(1978), 367–376.

    Google Scholar 

  16. 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. 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. 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. D.J. Rosenkrantz and R.E. Stearns, Properties of deterministic top-down grammars, Information and Control 17(1970), 226–255.

    Article  Google Scholar 

  20. R.E. Stearns, A regularity test for pushdown machines, Inform. Contr. 11(1967), 323–340

    Article  Google Scholar 

  21. 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. 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.

    Article  Google Scholar 

  23. L.G. Valinat, Regularity and related problems for deterministic pushdown automata, JACM 22 (1975), 1–10.

    Article  Google Scholar 

  24. L.C. Valiant, The equivalence problem for deterministic finite-turn pushdown automata, Info. Contr. 25, (1974), 123–133.

    Article  Google Scholar 

  25. 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion — Israel Institute of Technology, Haifa, Israel

    Yair Itzhaik

  2. Department of Computer Science, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, Israel

    Amiram Yehudai

Authors
  1. Yair Itzhaik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amiram Yehudai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Itzhaik, Y., Yehudai, A. (1983). On containment problems for finite-turn languages. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation