@article{ITA_1995__29_2_105_0, author = {Honkala, Juha}, title = {On morphically generated formal power series}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {105--127}, publisher = {EDP-Sciences}, volume = {29}, number = {2}, year = {1995}, mrnumber = {1329278}, zbl = {0816.68077}, language = {en}, url = {http://www.numdam.org/item/ITA_1995__29_2_105_0/} }
TY - JOUR AU - Honkala, Juha TI - On morphically generated formal power series JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1995 SP - 105 EP - 127 VL - 29 IS - 2 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1995__29_2_105_0/ LA - en ID - ITA_1995__29_2_105_0 ER -
%0 Journal Article %A Honkala, Juha %T On morphically generated formal power series %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1995 %P 105-127 %V 29 %N 2 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1995__29_2_105_0/ %G en %F ITA_1995__29_2_105_0
Honkala, Juha. On morphically generated formal power series. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 2, pp. 105-127. http://www.numdam.org/item/ITA_1995__29_2_105_0/
1. Rational Series and Their Languages, Springer-Verlag, Berlin, 1988. | MR | Zbl
and ,2. A morphic representation of complements of recursively enumerable sets, JACM, 1981, 28, pp. 706-714. | MR | Zbl
, and ,3. Structurally restricted maximal solutions of language equations involving morphisms, Mathematics Report 42, Tampere University of Technology, Department of Electrical Engineering, 1983.
, and ,4. A morphic representation of E 0 L languages and other ET 0 L languages, Discrete Appl. Math, 1985, 12, pp. 115-122. | MR | Zbl
, and ,5. The equivalence problem of multitape finite automata, Theoret. Comput. Sci., 1991, 78, (2), pp. 347-355. | MR | Zbl
and ,6. On generalized DT 0 L systems and their fixed points, Theoret. Comput. Sci., 1994, 127, pp. 269-286. | MR | Zbl
,7. Equations over finite sets of words and equivalence problems in automata theory. In: M. Ito, ed., Words, Languages and Combinatorics, World Scientific, Singapore, 1992, pp. 233-250. | MR | Zbl
,8. The Kleene and the Parikh theorem in complete semirings. In: T. Ottmann, ed., Automata, Languages and Programming, Springer-Verlag, Berlin, 1987, pp. 212-225. | MR | Zbl
,9. Semirings, Automata, Languages, Springer-Verlag, Berlin, 1986. | MR | Zbl
and ,10. J. VAN LEEUWEN, ed., Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990. | MR
11. Sur les séries associées à certains systèmes de Lindenmayer, Theoret. Comput. Sci., 1979, 9, pp. 363-375. | MR | Zbl
,12. The Mathematical Theory of L Systems, Academic Press, New York, 1980. | MR | Zbl
and ,13. G. ROZENBERG and A. SALOMAA, eds., The Book of L, Springer-Verlag, Berlin, 1986. | Zbl
14. G. ROZENBERG and A. SALOMAA, eds., Lindenmayer Systems, Springer-Verlag, Berlin, 1992. | MR | Zbl
15. A note on language equations involving morphisms, Inform. Process. Lett., 1978, 7, pp. 209-212. | MR | Zbl
,16. The inclusion problem for D 0 L languages, Elektron. Informationsverarbeit. Kybernetik, 1979, 15, pp. 535-548. | MR | Zbl
,17. The decidability of the D 0 L-DT 0 L equivalence problem, J. Comput. System Sci., 1981, 22, pp. 42-52. | MR | Zbl
,18. On machine characterization of nonrecursive hierarchies, Ann. Univ. Turkuensis, Ser. A I, 1984, 186, pp. 87-101. | MR | Zbl
,19. Formal Languages Academic Press, NewYork, 1973. | MR | Zbl
,20. Automata-Theoretic Aspects of Formal Power Series, Springer-Verlag, Berlin, 1978. | MR | Zbl
and ,