On morphically generated formal power series

Juha Honkala

doi:10.1051/ita/1995290201051

All issues

Volume 29 / No 2 (1995)

RAIRO-Theor. Inf. Appl., 29 2 (1995) 105-127

References

Free Access

Issue		RAIRO-Theor. Inf. Appl. Volume 29, Number 2, 1995


Page(s)		105 - 127
DOI		https://doi.org/10.1051/ita/1995290201051
Published online		01 February 2017

1. J. BERSTEL and C. REUTENAUER, Rational Series and Their Languages, Springer-Verlag, Berlin, 1988. [MR: 971022] [Zbl: 0668.68005] [Google Scholar]
2. A. EHRENFEUCHT , G. ROZENBERG and K. RUOHONEN, A morphic representation of complements of recursively enumerable sets, JACM, 1981, 28, pp. 706-714. [MR: 677082] [Zbl: 0491.68078] [Google Scholar]
3. A. EHRENFEUCHT, G. ROZENBERG and K. RUOHONEN, Structurally restricted maximal solutions of language equations involving morphisms, Mathematics Report 42, Tampere University of Technology, Department of Electrical Engineering, 1983. [Google Scholar]
4. A. EHRENFEUCHT, G. ROZENBERG and K. RUOHONEN, A morphic representation of E 0 L languages and other ET 0 L languages, Discrete Appl. Math, 1985, 12, pp. 115-122. [MR: 808452] [Zbl: 0579.68046] [Google Scholar]
5. T. HARJU and J. KARHUMÄKI, The equivalence problem of multitape finite automata, Theoret. Comput. Sci., 1991, 78, (2), pp. 347-355. [MR: 1095985] [Zbl: 0727.68063] [Google Scholar]
6. J. HONKALA, On generalized DT 0 L systems and their fixed points, Theoret. Comput. Sci., 1994, 127, pp. 269-286. [MR: 1275819] [Zbl: 0824.68059] [Google Scholar]
7. J. KARHUMÄKI, 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: 1161025] [Zbl: 0900.20106] [Google Scholar]
8. W. KUICH, 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: 912710] [Zbl: 0625.16026] [Google Scholar]
9. W. KUICH and A. SALOMAA, Semirings, Automata, Languages, Springer-Verlag, Berlin, 1986. [MR: 817983] [Zbl: 0582.68002] [Google Scholar]
10. J. VAN LEEUWEN, ed., Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990. [MR: 1127176] [Google Scholar]
11. C. REUTENAUER, Sur les séries associées à certains systèmes de Lindenmayer, Theoret. Comput. Sci., 1979, 9, pp. 363-375. [MR: 545473] [Zbl: 0456.68084] [Google Scholar]
12. G. ROZENBERG and A. SALOMAA, The Mathematical Theory of L Systems, Academic Press, New York, 1980. [MR: 561711] [Zbl: 0508.68031] [Google Scholar]
13. G. ROZENBERG and A. SALOMAA, eds., The Book of L, Springer-Verlag, Berlin, 1986. [Zbl: 0575.00023] [Google Scholar]
14. G. ROZENBERG and A. SALOMAA, eds., Lindenmayer Systems, Springer-Verlag, Berlin, 1992. [MR: 1226682] [Zbl: 0755.00005] [Google Scholar]
15. K. RUOHONEN, A note on language equations involving morphisms, Inform. Process. Lett., 1978, 7, pp. 209-212. [MR: 483780] [Zbl: 0385.68058] [Google Scholar]
16. K. RUOHONEN, The inclusion problem for D 0 L languages, Elektron. Informationsverarbeit. Kybernetik, 1979, 15, pp. 535-548. [MR: 572442] [Zbl: 0428.68081] [Google Scholar]
17. K. RUOHONEN, The decidability of the D 0 L-DT 0 L equivalence problem, J. Comput. System Sci., 1981, 22, pp. 42-52. [MR: 614360] [Zbl: 0491.68048] [Google Scholar]
18. K. RUOHONEN, On machine characterization of nonrecursive hierarchies, Ann. Univ. Turkuensis, Ser. A I, 1984, 186, pp. 87-101. [MR: 748522] [Zbl: 0562.03023] [Google Scholar]
19. A. SALOMAA, Formal Languages Academic Press, NewYork, 1973. [MR: 438755] [Zbl: 0262.68025] [Google Scholar]
20. A. SALOMAA and M. SOITTOLA, Automata-Theoretic Aspects of Formal Power Series, Springer-Verlag, Berlin, 1978. [MR: 483721] [Zbl: 0377.68039] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.

Homepage

Table of Contents

Previous article Next article

Article

Metrics

Show article metrics

Services

Articles citing this article
CrossRef (3)
Same authors
- Google Scholar
- EDP Sciences database

Bookmarking

[1] 1. J. BERSTEL and C. REUTENAUER, Rational Series and Their Languages, Springer-Verlag, Berlin, 1988. [MR: 971022] [Zbl: 0668.68005] [Google Scholar]

[2] 2. A. EHRENFEUCHT , G. ROZENBERG and K. RUOHONEN, A morphic representation of complements of recursively enumerable sets, JACM, 1981, 28, pp. 706-714. [MR: 677082] [Zbl: 0491.68078] [Google Scholar]

[3] 3. A. EHRENFEUCHT, G. ROZENBERG and K. RUOHONEN, Structurally restricted maximal solutions of language equations involving morphisms, Mathematics Report 42, Tampere University of Technology, Department of Electrical Engineering, 1983. [Google Scholar]

[4] 4. A. EHRENFEUCHT, G. ROZENBERG and K. RUOHONEN, A morphic representation of E 0 L languages and other ET 0 L languages, Discrete Appl. Math, 1985, 12, pp. 115-122. [MR: 808452] [Zbl: 0579.68046] [Google Scholar]

[5] 5. T. HARJU and J. KARHUMÄKI, The equivalence problem of multitape finite automata, Theoret. Comput. Sci., 1991, 78, (2), pp. 347-355. [MR: 1095985] [Zbl: 0727.68063] [Google Scholar]

[6] 6. J. HONKALA, On generalized DT 0 L systems and their fixed points, Theoret. Comput. Sci., 1994, 127, pp. 269-286. [MR: 1275819] [Zbl: 0824.68059] [Google Scholar]

[7] 7. J. KARHUMÄKI, 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: 1161025] [Zbl: 0900.20106] [Google Scholar]

[8] 8. W. KUICH, 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: 912710] [Zbl: 0625.16026] [Google Scholar]

[9] 9. W. KUICH and A. SALOMAA, Semirings, Automata, Languages, Springer-Verlag, Berlin, 1986. [MR: 817983] [Zbl: 0582.68002] [Google Scholar]

[10] 10. J. VAN LEEUWEN, ed., Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990. [MR: 1127176] [Google Scholar]

[11] 11. C. REUTENAUER, Sur les séries associées à certains systèmes de Lindenmayer, Theoret. Comput. Sci., 1979, 9, pp. 363-375. [MR: 545473] [Zbl: 0456.68084] [Google Scholar]

[12] 12. G. ROZENBERG and A. SALOMAA, The Mathematical Theory of L Systems, Academic Press, New York, 1980. [MR: 561711] [Zbl: 0508.68031] [Google Scholar]

[13] 13. G. ROZENBERG and A. SALOMAA, eds., The Book of L, Springer-Verlag, Berlin, 1986. [Zbl: 0575.00023] [Google Scholar]

[14] 14. G. ROZENBERG and A. SALOMAA, eds., Lindenmayer Systems, Springer-Verlag, Berlin, 1992. [MR: 1226682] [Zbl: 0755.00005] [Google Scholar]

[15] 15. K. RUOHONEN, A note on language equations involving morphisms, Inform. Process. Lett., 1978, 7, pp. 209-212. [MR: 483780] [Zbl: 0385.68058] [Google Scholar]

[16] 16. K. RUOHONEN, The inclusion problem for D 0 L languages, Elektron. Informationsverarbeit. Kybernetik, 1979, 15, pp. 535-548. [MR: 572442] [Zbl: 0428.68081] [Google Scholar]

[17] 17. K. RUOHONEN, The decidability of the D 0 L-DT 0 L equivalence problem, J. Comput. System Sci., 1981, 22, pp. 42-52. [MR: 614360] [Zbl: 0491.68048] [Google Scholar]

[18] 18. K. RUOHONEN, On machine characterization of nonrecursive hierarchies, Ann. Univ. Turkuensis, Ser. A I, 1984, 186, pp. 87-101. [MR: 748522] [Zbl: 0562.03023] [Google Scholar]

[19] 19. A. SALOMAA, Formal Languages Academic Press, NewYork, 1973. [MR: 438755] [Zbl: 0262.68025] [Google Scholar]

[20] 20. A. SALOMAA and M. SOITTOLA, Automata-Theoretic Aspects of Formal Power Series, Springer-Verlag, Berlin, 1978. [MR: 483721] [Zbl: 0377.68039] [Google Scholar]