On Infinite Terms Having a Decidable Monadic Theory
On Infinite Terms Having a Decidable Monadic Theory
复制标题
在无限项上具有可判定的一元理论
DOI:
10.1007/3-540-45687-2_13
复制
发表时间:
2002
期刊:
影响因子:
--
通讯作者:
D. Caucal
中科院分区:
文献类型:
--
作者:
D. Caucal
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.