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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almeida, J.: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics. Algebra Universalis 27, 333–350 (1990)
Bernátsky, L.: Regular expression star-freeness is PSPACE-complete. Acta Cybernetica 13, 1–21 (1997)
Cho, S., Huynh, D.T.: Finite-automaton aperiodicity is PSPACE-complete. Theoretical Computer Science 88, 99–116 (1991)
Eilenberg, S.: Automata, Languages, and Machines, vol. A&B. Academic Press, London (1974)
Ésik, Z.: Definite tree automata and their cascade compositions. Publ. Math. 48, 243–262 (1996)
É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)
Ésik, Z.: Characterizing CTL-like logics on finite trees. Theoretical Computer Science 356, 136–152 (2006)
Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
Grätzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)
Heuter, U.: Definite tree languages. Bulletin of the EATCS 35, 137–142 (1988)
Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. RAIRO Inform. Théor. Appl. 25, 125–145 (1991)
McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, Cambridge, MA (1971)
Potthoff, A.: Modulo-counting quantifiers over finite trees. Theoretical Computer Science 126, 97–112 (1994)
Steinby, M.: A theory of tree language varieties. In: Tree Automata and Languages, North-Holland, Amsterdam, pp. 57–81 (1992)
Steinby, M.: General varieties of tree languages. Theoretical Computer Science 205, 1–43 (1998)
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)
Author information
Authors and Affiliations
Editor information
Rights 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)