Abstract
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism property makes it usable on trees (finite or infinite).
We apply our result for proving that, over trees, every monadic interpretation is equivalent to the composition of a first-order interpretation (with access to the ancestor relation) and a monadic marking. Using this remark, we give new characterisations for prefix-recognisable structures and for the Caucal hierarchy.
Furthermore, we believe that this approach has other potential applications.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blumensath, A.: Prefix-recognisable graphs and monadic second-order logic. Technical Report AIB-06-2001, RWTH Aachen (May 2001)
Bojańczyk, M., Colcombet, T.: Bounds in omega-regularity. In: IEEE Symposium on Logic In Computer Science, pp. 285–296. IEEE Computer Society Press, Los Alamitos (2006)
Brown, T.C.: An interesting combinatorial method in the theory of locally finite semigroups. Pacific Journal of Mathematics 36(2), 277–294 (1971)
Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford University press, Stanford (1960)
Büchi, J.R., Elgot, C.C.: Decision problems of weak second order arithmetics and finite automata. Notices of the American Math. Soc. 5, 834 (1958)
Carayol, A., Wöhrle, S.: The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003. LNCS, vol. 2914, pp. 112–123. Springer, Heidelberg (2003)
Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194–205. Springer, Heidelberg (1996)
Caucal, D.: On infinite terms having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 165–176. Springer, Heidelberg (2002)
Chalopin, J., Leung, H.: On factorization forests of finite height. Theoretical Computer Science 310(1–3), 489–499 (2004)
Green, J.A.: On the structure of semigroups. Annals of Mathematics 54(1), 163–172 (1951)
Hashiguchi, K.: Relative star height, star height and finite automata with distance functions. In: Formal Properties of Finite Automata and Applications, pp. 74–88 (1988)
Kirsten, D.: Distance desert automata and the star height problem. RAIRO 3(39), 455–509 (2005)
McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9(5), 521–530 (1966)
Niwinski, D., Walukiewicz, I.: Ambiguity problem for automata on infinite trees. Personal communication (1997)
Perrin, D., Pin, J-E.: Semigroups,Formal Languages and Groups. In: chapter Semigroups and automata on infinite words, pp. 49–72. Kluwer Academic Publishers, Dordrecht (1995)
Pin, J-E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Syst. 30(4), 383–422 (1997)
Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. soc. 141, 1–35 (1969)
Safra, S.: On the complexity of omega-automata. In: FOCS, pp. 319–327 (1988)
Shelah, S.: The monadic theory of order. Annals Math. 102, 379–419 (1975)
Simon, I.: Factorization forests of finite height. Theor. Comput. Sci. 72(1), 65–94 (1990)
Simon, I.: On semigroups of matrices over the tropical semiring. ITA 28(3-4), 277–294 (1994)
Thomas, W.: A combinatorial approach to the theory of ω-automata. Information and Control 48, 261–283 (1981)
Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol. III, pp. 389–455. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colcombet, T. (2007). A Combinatorial Theorem for Trees. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_77
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)