Jul 10, 2012 · We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for ...
Jul 14, 2014 · We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control; ...
[PDF] On periodically iterated morphisms - Semantic Scholar
www.semanticscholar.org › paper › On-p...
The computational power of periodically iterated morphisms, also known as D0L systems with periodic control, is investigated; it is shown it is already ...
We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short.
A sequence is called ultimately periodic if it has a period. The following theorem gives a basic result concerning periodicities in D0L se- quences (see [2,3]).
We compute their subword complexity, and show that they can always be generated by iterating periodically a finite number of morphisms. Moreover, we define a ...
One of the most frequently used way to generate infite words is to use DOL systems (cf. [Sa] and [Be]). In this method an infinite word is obtained from.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...
May 28, 2005 · In this paper we show that there exist infinite words generated by a periodic application of a finite number of morphisms such that they ...
We prove that there is a positive integer q such that for any positive integer p, the prefixes of un (resp. vn) of length p form an ultimately periodic sequence ...