ITERATIVE DEVICES GENERATING INFINITE WORDS

Karel Čulík, Juhani Karhumäki · International Journal of Foundations of Computer Science · 1994

We consider various TAG-like devices that generate one-way infinite words in real time. The simplest types of these devices are equivalent to iterative morphisms (also called substitutions), automatic sequences and iterative DGSM’s. We consider also a few new types. Mainly we study the comparative power of these mechanisms and develop some techniques for proving that certain devices cannot produce a particular infinite word.

Read the paper · More papers on PaperTik