Skip to main content
Springer Nature Link
Log in

An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs

  • Conference paper
Language and Automata Theory and Applications (LATA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5196))

  • 878 Accesses

Abstract

This paper presents an efficient algorithm solving the inclusion problem of a new subclass of context-free languages. The languages are accepted by the special kind of real-time deterministic pushdown automata, called strongly forward-deterministic pushdown automata, that go to the same state and push the same sequence of stack symbols whenever transition is allowed on the same input symbol. Our algorithm can be applied to efficient identification in the limit of that class from positive data.

This research was partially supported by a grant from the Global COE Program, “Center for Next-Generation Information Technology based on Knowledge Discovery and Knowledge Federation”, from the Ministry of Education, Culture, Sports, Science and Technology of Japan.

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.

Similar content being viewed by others

References

  1. Asveld, P.R.J., Nijholt, A.: The inclusion problem for some subclasses of context-free languages. Theoretical Computer Science 230(1-2), 247–256 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Friedman, E.P.: The inclusion problem for simple languages. Theoretical Computer Science 1(4), 297–316 (1976)

    Article  MATH  Google Scholar 

  3. Friedman, E.P., Greibach, S.A.: Superdeterministic dpdas: The method for accepting does affect decision problems. Journal of Computer and System Science 19(1), 79–117 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  4. Greibach, S.A., Friedman, E.P.: Superdeterministic PDAs: A subcase with a decidable inclusion problem. Journal of the Association for Computing Machinery 27(4), 675–700 (1980)

    MATH  MathSciNet  Google Scholar 

  5. Linna, M.: Two decidability results for deterministic pushdown automata. Journal of Computer and System Science 18, 92–107 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  6. Tozawa, A., Minamide, Y.: Complexity results on balanced context-free languages. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 346–360. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Wakatsuki, M., Teraguchi, K., Tomita, E.: Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 260–272. Springer, Heidelberg (2004)

    Google Scholar 

  8. Wakatsuki, M., Tomita, E.: A fast algorithm for checking the inclusion for very simple deterministic pushdown automata. IEICE transactions on information and systems  E76-D(10), 1224–1233 (1993)

    Google Scholar 

  9. Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 298, 179–206 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 377(1–3), 282–283 (2003); Theoret. Comput. Sci. 298, 179–206 (2003)

    MathSciNet  Google Scholar 

  11. Yoshinaka, R.: Polynomial-time identification of an extension of very simple grammars from positive data. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 45–58. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hokkaido University,  

    Ryo Yoshinaka

Authors
  1. Ryo Yoshinaka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoshinaka, R. (2008). An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88282-4_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88281-7

  • Online ISBN: 978-3-540-88282-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics