D0LDeterministic, Zero-Sided Lindenmayer System
References in periodicals archive ?
In this paper we study infinite permutations generated by infinite D0L words.
While we have had one set of audit standards we have had to comply with many additional requirements to meet the needs of the SEC, D0L and GA0.
On the other hand, certain equality languages, namely those with elementary morphisms, played a crucial role in a nice solution of the celebrated D0L sequence equivalence problem, see [ER78].