On various classes of infinite words obtained by iterated mappings. (English) Zbl 0571.68065

Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 188-197 (1985).
[For the entire collection see Zbl 0563.00019.]
We define sets of infinite words generated by various classes of iterated mappings. We show that every infinite word generated by an extended tag system can also be generated by an \(\epsilon\)-free tag system. We give a full inclusion graph and several closure properties for the sets of infinite words considered. We investigate some extensions of tag systems using iterated sequential mappings.


68Q45 Formal languages and automata


Zbl 0563.00019