Abstract
We study a transformation on terms consisting of applying an inverse deterministic rational mapping followed by an unfolding. Iterating these transformations from the regular terms gives a hierarchy of families of terms having a decidable monadic theory. In particular, the family at level 2 contains the morphic infinite words investigated by Carton and Thomas. We show that this hierarchy coincides with the hierarchy considered by Knapik, Niwiński and Urzyczyn: the families of terms that are solutions of higher order safe schemes. We also show that this hierarchy coincides with the hierarchy defined by Damm, and recently considered by Courcelle and Knapik: the families of terms obtained by iterating applications of first order substitutions to the set of regular terms. Finally, using second order substitutions yields the same terms.
This is a preview of subscription content, log in via an institution to check access.
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
K. Barthelmann, When can an equational simple graph be generated by hyperedge replacement, 23rd MFCS, LNCS 1450, L. Brim, J. Gruska, J. Zlatuska (Eds.), 543–552 (1998).
A. Blumensath, Axiomatising tree-interpretable structures, 19th STACS, LNCS 2285, H. Alt, A. Ferreira (Eds.), 596–607 (2002).
O. Carton and W. Thomas, The monadic theory of morphic infinite words and generalizations, 25th MFCS, LNCS 1893, M. Nielsen and B. Rovan (Eds.), 275–284 (2000).
D. Caucal, On the regular structure of prefix rewriting, 15th CAAP, LNCS 431, A. Arnold (Ed.), 87–102 (1990) [a full version is in Theoretical Computer Science 106, 61-86 (1992)].
D. Cupaucal, On infinite transition graphs having a decidable monadic theory, 23rd ICALP, LNCS 1099, F. Meyer auf der Heide, B. Monien (Eds.), 194–205 (1996) [a full version will appear in Theoretical Computer Science].
D. Caucal and T. Knapik, An internal presentation of regular graphs by prefix-recognizable ones, Theory of Computing Systems 34–4 (2001).
B. Courcelle, Fundamental properties of infinite trees, Theoretical Computer Science 25, 95–169 (1983).
B. Courcelle, Graph rewriting: an algebraic and logic approach, Handbook of Theoretical Computer Science Vol. B, J. Leeuwen (Ed.), Elsevier, 193–242 (1990).
B. Courcelle, Recursive applicative program schemes, Handbook of Theoretical Computer Science Vol. B, J. Leeuwen (Ed.), Elsevier, 459–492 (1990).
B. Courcelle, Monadic second-order definable graph trans ductions: a survey, Theoretical Computer Science 126, 53–75 (1994).
B. Courcelle and T. Knapik, The evaluation of first-order substitution is monadic second-order compatible, to appear in Theoretical Computer Science (2002).
B. Courcelle and I. Walukiewicz, Monadic second-order logic, graph coverings and unfoldings of transition systems, Annals of Pure and Applied Logic 92, 35–62 (1998).
W. Damm, The IO and OI hierarchies, Theoretical Computer Science 20(2), 95–208 (1982).
J. Engelfriet, Iterated push-down automata and complexity classes, 15th STOC, 365–373 (1983).
I. Guessarian, Algebraic semantics, LNCS 99, Sringer Verlag, (1981).
K. Indermark, Schemes with recursion on higher types, 5th MFCS, LNCS 45, A. Mazurkiewicz (Ed.), 352–358 (1976).
T. Knapik, D. Niwiński and P. Urzyczyn, Deciding monadic theories of hyperalgebraic trees, 5th International Conference on Typed Lambda Calculi and Applications, LNCS 2044, Abramsky (Ed.), 253–267 (2001).
T. Knapik, D. Niwinski and P. Urzyczyn, Higher-order pushdown trees are easy, 5th FOSSACS, to appear in LNCS, M. Nielsen (Ed.), (2002).
O. Kupferman and M. Vardi, An automata-theoretic approach to reasoning about infinite-state systems, 12th CAV, LNCS 1855, A. Emerson, P. Sistla (Eds.), 36–52 (2000).
S. La Torre and M. Napoli, Automata-based representations for infinite graphs, Theoretical Informatics and Applications 35, 311–330 (2001).
D. Muller and P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science 37, 51–75 (1985).
M. Nivat, On the interpretation of polyadic recursive schemes, Symposia Mathematica 15, Academic Press (1975).
M. Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the American Mathematical Society 141, 1–35 (1969).
A. Semenov, Decidability of monadic theories, MFCS 84, LNCS 176, W. Brauer (Ed.), 162–175 (1984).
G. Sénizergues, The equivalence problem for deterministic pushdown automata is decidable, 24th ICALP, LNCS 1256, P. Degano, R. Gorrieri, A. Marchetti-Spaccamela (Eds.), 671–681 (1997).
W. Thomas, Automata on infinite objects, Handbook of Theoretical Computer Science Vol. B, J. Leeuwen (Ed.), Elsevier, 135–191 (1990).
W. Thomas, Languages, automata, and logic, Handbook of Formal Languages, Vol. 3, G. Rozenberg, A. Salomaa (Eds.), Springer, 389–456 (1997).
J. Tiuryn, Higher-order arrays and stacks in programming: An application of complexity theory to logics of programs, 12th MFCS, LNCS 233, J. Gruska, B. Rovan, J. Wiedermann (Eds.), 177–198 (1986).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caucal, D. (2002). On Infinite Terms Having a Decidable Monadic Theory. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive