Abstract
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 ε-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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
