no. 1
The decidability of the equivalence problem for polynomially bounded DOL sequences
RAIRO. Informatique théorique, Tome 11 (1977) no. 1, pp. 17-28. 
@article{ITA_1977__11_1_17_0,
     author = {Karhum\"aki, Juhani},
     title = {The decidability of the equivalence problem for polynomially bounded {DOL} sequences},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {17--28},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {11},
     number = {1},
     year = {1977},
     mrnumber = {464724},
     zbl = {0359.68086},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1977__11_1_17_0/}
}
TY  - JOUR
AU  - Karhumäki, Juhani
TI  - The decidability of the equivalence problem for polynomially bounded DOL sequences
JO  - RAIRO. Informatique théorique
PY  - 1977
SP  - 17
EP  - 28
VL  - 11
IS  - 1
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - http://www.numdam.org/item/ITA_1977__11_1_17_0/
LA  - en
ID  - ITA_1977__11_1_17_0
ER  - 
%0 Journal Article
%A Karhumäki, Juhani
%T The decidability of the equivalence problem for polynomially bounded DOL sequences
%J RAIRO. Informatique théorique
%D 1977
%P 17-28
%V 11
%N 1
%I Centrale des revues, Dunod-Gauthier-Villars
%C Montreuil
%U http://www.numdam.org/item/ITA_1977__11_1_17_0/
%G en
%F ITA_1977__11_1_17_0
Karhumäki, Juhani. The decidability of the equivalence problem for polynomially bounded DOL sequences. RAIRO. Informatique théorique, Tome 11 (1977) no. 1, pp. 17-28. http://www.numdam.org/item/ITA_1977__11_1_17_0/

1. K. Culik , II, On the Decidability of the Sequence Equivalence Problem for DOL-Systems, Manuscript, 1975. | MR

2. A. Ehrenfeucht and G. Rozenberg, DOL-Systems with Rank, Lecture Notes in Computer Science, Springer, Vol. 15, 1974, pp. 136-141. | MR | Zbl

3. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. | MR | Zbl

4. G. Herman and G. Rozenberg, Developmental Systems and Languages, North-Holland, Amsterdam, 1975. | MR | Zbl

5. K. P. Lee and G. Rozenberg, The Length Sets of DOL Languages Are Uniformely Bounded, Information Processing Letters, Vol. 2, 1974, pp. 185-188. | MR | Zbl

6. M. Nielsen, On the Decidability of Some Equivalence Problems For DOL-Systems, Information and Control, Vol. 25, 1974, pp. 166-193. | MR | Zbl

7. Problem book. Unusual Automata Theory, January 1972, Dept. of Computer Science, Univ. of Aarhus, Tech. Report DAIMI PB-15, 1973, pp. 14-26.

8. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, in J. T. Tou (éd.), Advances in Information Systems Science, Plenum Press, New York, Vol. 6, 1976, pp. 161-206. | MR | Zbl

9. L. G. Valiant, The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets, Manuscript, 1975.