Skip to main content
Springer Nature Link
Log in

Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton

  • Conference paper
Implementation and Application of Automata (CIAA 2005)

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

Included in the following conference series:

Abstract

In this paper, a deterministic recognition algorithm for the class of tree languages accepted by (nondeterministic) linear pushdown tree automata (L-PDTAs) is proposed. L-PDTAs accept an important class of tree languages since the class of their yield languages coincides with the class of yield languages generated by tree adjoining grammars (TAGs). The proposed algorithm is obtained by combining a bottom-up parsing procedure on trees with the CKY (Cocke-Kasami-Younger) algorithm. The running time of the algorithm is O(n 4), where n is the number of nodes of an input tree.

This study is supported in part by a Grant-in-Aid for Young Scientists ((B) 17700004) from the Japanese Ministry of Education, Culture, Sports, Science and Technology.

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. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) release (October 1, 2002) available on: http://www.grappa.univ-lille3.fr/tata

  2. Gécseg, F., Steinby, M.: Tree Languages. In: Handbook of Formal Languages, vol. 3, pp. 1–68. Springer, Berlin (1997)

    Chapter  Google Scholar 

  3. Guessarian, I.: Pushdown tree automata. Mathematical Systems Theory 16, 237–263 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  4. Tanaka, S., Kasai, T.: The emptiness problem for indexed languages is exponential time complete. IEICE Trans (published in Japanese) J68-D, 1727–1734 (1985)

    Google Scholar 

  5. Fujiyoshi, A., Kasai, T.: Spinal-formed context-free tree grammars. Theory of Computing Systems 33, 59–83 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fujiyoshi, A.: Linearity and nondeletion on monadic context-free tree grammars. Information Processing Letters 93, 103–107 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Abeillé, A., Rambow, O. (eds.): Tree adjoining grammars: formalisms, linguistic analysis and processing. CSLI Publications, Stanford, California (2000)

    MATH  Google Scholar 

  8. Fujiyoshi, A.: Epsilon-free grammars and lexicalized grammars that generate the class of the mildly context-sensitive languages. In: Proceedings of 7th International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+7), Vancouver, pp. 16–23 (2004)

    Google Scholar 

  9. Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct grammars. J. Computer & System Sciences 10, 136–163 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  10. Joshi, A.K., Schabes, Y.: Tree-adjoining grammars. In: Handbook of Formal Languages, vol. 3, pp. 69–124. Springer, Berlin (1997)

    Chapter  Google Scholar 

  11. Rajasekaran, S.: Tree-adjoining language parsing in O(n 6) time. SIAM J. Comput. 25, 862–873 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Rajasekaran, S., Yooseph, S.: TAL recognition in O(M(n 2)) time. J. Computer & System Sciences 56, 83–89 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  13. Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory 27, 511–546 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Rounds, W.C.: Mapping and grammars on trees. Mathematical Systems Theory 4, 257–287 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, Hitachi, Ibaraki, 316-8511, Japan

    Akio Fujiyoshi

  2. Graduate School of Electro-Communications, University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo, 182-8585, Japan

    Ikuo Kawaharada

Authors
  1. Akio Fujiyoshi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ikuo Kawaharada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sophia Antipolis, Laboratoire I3S, Les Algorithmes - bât. Euclide B, Université de Nice, 2000, route des lucioles, BP 121, 06903, Sophia Antipolis - Cedex, France

    Jacques Farré

  2. Sophia Antipolis, Ecole Polytechnique, Université de Nice, 930, route des colles, BP 145, 06903, Sophia Antipolis - Cedex, France

    Igor Litovsky

  3. Laboratoire I3S, Université de Nice, Sophia Antipolis & CNRS, France

    Sylvain Schmitz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujiyoshi, A., Kawaharada, I. (2006). Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_11

Download citation

  • DOI: https://doi.org/10.1007/11605157_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31023-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics