Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algebraic Informatics

CAI 2007: Algebraic Informatics pp 189–207Cite as

Aperiodicity in Tree Automata

  • Conference paper

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

Abstract

We define and compare several different notions of aperiodicity in tree automata. We also relate these notions to the cascade product and logical definability of tree languages.

Research supported by the AUTOMATHA project of ESF and the National Foundation for Scientific Research of Hungary, grant T466886.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Almeida, J.: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics. Algebra Universalis 27, 333–350 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bernátsky, L.: Regular expression star-freeness is PSPACE-complete. Acta Cybernetica 13, 1–21 (1997)

    MATH  MathSciNet  Google Scholar 

  3. Cho, S., Huynh, D.T.: Finite-automaton aperiodicity is PSPACE-complete. Theoretical Computer Science 88, 99–116 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Eilenberg, S.: Automata, Languages, and Machines, vol. A&B. Academic Press, London (1974)

    MATH  Google Scholar 

  5. Ésik, Z.: Definite tree automata and their cascade compositions. Publ. Math. 48, 243–262 (1996)

    MATH  Google Scholar 

  6. Ésik, Z.: An algebraic characterization of temporal logics on finite trees. Parts I, II, III. In: 1st International Conference on Algebraic Informatics, 2005, pp. 53–77, 79–99, 101–110, Aristotle Univ. Thessaloniki, Thessaloniki (2005)

    Google Scholar 

  7. Ésik, Z.: Characterizing CTL-like logics on finite trees. Theoretical Computer Science 356, 136–152 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)

    MATH  Google Scholar 

  9. Grätzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)

    MATH  Google Scholar 

  10. Heuter, U.: Definite tree languages. Bulletin of the EATCS 35, 137–142 (1988)

    MATH  Google Scholar 

  11. Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. RAIRO Inform. Théor. Appl. 25, 125–145 (1991)

    MATH  MathSciNet  Google Scholar 

  12. McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, Cambridge, MA (1971)

    MATH  Google Scholar 

  13. Potthoff, A.: Modulo-counting quantifiers over finite trees. Theoretical Computer Science 126, 97–112 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  14. Steinby, M.: A theory of tree language varieties. In: Tree Automata and Languages, North-Holland, Amsterdam, pp. 57–81 (1992)

    Google Scholar 

  15. Steinby, M.: General varieties of tree languages. Theoretical Computer Science 205, 1–43 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Thomas, W.: Logical aspects in the study of tree languages. In: Ninth colloquium on trees in algebra and programming (Bordeaux, 1984), pp. 31–49. Cambridge Univ. Press, Cambridge (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Sci. Univ. Szeged, Hungary

    Zoltan Ésik & Szabolcs Iván

  2. GRLMC, Rovira i Virgili University, Tarragona, Spain

    Zoltan Ésik

Authors
  1. Zoltan Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Szabolcs Iván
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Symeon Bozapalidis George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z., Iván, S. (2007). Aperiodicity in Tree Automata. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2007. Lecture Notes in Computer Science, vol 4728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75414-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75414-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-75414-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation