论文信息 - The Sequence Equivalence Problem for D0L Systems is Decidable

The Sequence Equivalence Problem for D0L Systems is Decidable

The sequence equivalence problem for DOL systems is shown to be decidable. In an algebraic formulation the sequence equivalence problem for DOL systems can be stated as follows: Given homomorphisms h1 and h2 on a free monoid Σ* and a word σ from Σ*, is h 1 n (σ)=h 2 n (σ) for all n>0?

Karel Culik | Ivan Fris

[1] A. Lindenmayer. Developmental systems without cellular interactions, their languages and grammars. , 1971, Journal of theoretical biology.

[2] L. Mirsky,et al. The Theory of Matrices , 1961, The Mathematical Gazette.

[3] Arto Salomaa,et al. Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems , 1973, Inf. Control..

[4] Karel Culik. On the Decidability of the Sequence Equivalence Problem for D0L-Systems , 1976, Theor. Comput. Sci..

[5] Karel Čnulík. On some families of languages related to developmental systems , 1974 .

[6] Mogens Nielsen,et al. On the Decidability of Some Equivalence Problems for D0L-Systems , 1973, Inf. Control..