Skip to main content
SpringerLink
Log in

Automata and Logics for Unranked and Unordered Trees

  • Conference paper
Term Rewriting and Applications (RTA 2005)

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

Included in the following conference series:

Abstract

In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unordered trees. We survey classes of tree automata introduced for the logics PMSO and CMSO as well as other related formalisms; we gather results from the literature and sometimes clarify or fill the remaining gaps between those various formalisms. Finally, we complete our study by adapting these classes of automata for capturing precisely the expressiveness of the logic MSO.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carme, J., Niehren, J., Tommasi, M.: Querying Unranked Trees with Stepwise Tree Automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 105–118. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Colcombet, T.: Rewriting in the partial algebra of typed terms modulo AC. Electronic Notes in Theoretical Computer Science, vol. 68. Elsevier Science Publishers, Amsterdam (2002)

    Google Scholar 

  3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997), Available on: http://www.grappa.univ-lille3.fr/tata (release October 1, 2002)

  4. Courcelle, B.: The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. IC 85(1), 12–75 (1990)

    MATH  MathSciNet  Google Scholar 

  5. Courcelle, B.: The monadic second order logic of graphs VI: on several representations of graphs by relational structures. Discrete Applied Mathematics 54(2-3), 117–149 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Courcelle, B.: Basic notions of universal algebra for language theory and graph grammars. Theoretical Computer Science 163, 1–54 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dal-Zilio, S., Lugiez, D.: XML Schema, Tree Logic and Sheaves Automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 246–263. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Dal-Zilio, S., Lugiez, D., Meyssonnier, C.: A logic you can count on. In: 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2004)

    Google Scholar 

  9. Gaubert, S., Giua, A.: Petri net languages and infinite subsets of Nm. Journal of Computer System Sciences 59(3), 373–391 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Guaiana, G., Restivo, A., Salemi, S.: On Aperiodic Trace Languages. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol. 480, pp. 76–88. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  11. Klaedtke, F., Rueß, H.: Monadic Second-Order Logics with Cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control 11(2-3), 3–29 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  13. Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science 275(1-2), 633–674 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Niehren, J., Podelski, A.: Feature Automata and Recognizable Sets of Feature Trees. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol. 668, pp. 356–375. Springer, Heidelberg (1993)

    Google Scholar 

  15. Ohsaki, H.: Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 539–553. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Ohsaki, H., Takai, T.: Decidability and Closure Properties of Equational Tree Languages. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 114–128. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Parikh, R.J.: On context-free languages. Journal of the ACM 13(4), 570–581 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  18. Seidl, H., Schwentick, T., Muscholl, A.: Numerical Document Queries. In: Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 155–166. ACM Press, New York (2003)

    Chapter  Google Scholar 

  19. Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory 2, 57–82 (1968)

    Article  MathSciNet  Google Scholar 

  20. Verma, K.N.: Two-Way Equational Tree Automata for AC-like Theories: Decidability and Closure Properties. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 180–197. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Lille, UMR CNRS/USTL 8022, INRIA Futurs – MOSTRARE Project,  

    Iovka Boneva & Jean-Marc Talbot

Authors
  1. Iovka Boneva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Marc Talbot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LuFG Informatik 2, RWTH Aachen University, Germany

    Jürgen Giesl

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boneva, I., Talbot, JM. (2005). Automata and Logics for Unranked and Unordered Trees. In: Giesl, J. (eds) Term Rewriting and Applications. RTA 2005. Lecture Notes in Computer Science, vol 3467. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32033-3_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32033-3_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25596-3

  • Online ISBN: 978-3-540-32033-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation