On transformations of formal power series

Information and Computation

Volumn 184, Issue 2, 2003, Pages 369-383

  Droste, Manfred ^a   Zhang, Guo Qiang ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b Case Western Reserve University   (United States)

Author keywords

Formal power series; Rational languages; Recognizable languages; Weighted finite automata

Indexed keywords

ENCODING (SYMBOLS); FORMAL LANGUAGES; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

FORMAL POWER SERIES;

COMPUTATION THEORY;

EID: 0043175104     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00066-X     Document Type: Article

References (17)

1. J. Berstel, Ch. Reutenauer, Rational Series and Their Languages, EATCS Monographs in Theoretical Computer Science, vol. 12, Springer, Berlin, 1988.
2. C. Cortes, M. Mohri, Context-free recognition with weighted automata, Grammars 3 (2000) 133-150.
3. M. Droste, P. Gastin, On aperiodic and star-free formal power series in partially commuting variables, Formal Power Series and Algebraic Combinatorics (Moscow, 2000), Springer, Berlin, 2000, pp. 158-169.
4. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, 1974.
5. S. Gaubert, M. Plus, Methods and applications of (max, +) linear algebra, Proceedings of STACS'97, Lecture Notes in Computer Science, vol. 1200, Springer, Berlin, 1997, pp. 261-282.
6. K. Hashiguchi, Algorithms for determining relative star height and star height, Inform. Comput. 78 (1988) 124-169.
7. S.R. Kosaraju, Regularity preserving functions, SIGACT News 6 (2) (1974) 16-17.
8. D. Kozen, On regularity-preserving functions, Bull. EATCS 58 (1996) 131-138.
9. W. Kuich, Semirings and formal power series: their relevance to formal languages and automata, in: G. Rozenberg, A. Salomaa (Eds.), Handbook on Formal Languages, vol. 1, Springer, Berlin, 1997, pp. 609-677.
10. W. Kuich, A. Salomaa, Semirings, Automata, Languages, EATCS Monographs in Theoretical Computer Science, vol. 6, Springer, Berlin, 1986.
11. M. Mohri, Finite-state transducers in language and speech processing, Comput. Linguist. 23 (1997) 269-311.
12. A. Salomaa, M. Soittola, Automata-Theoretic Aspects of Formal Power Series, Texts and Monographs in Computer Science, Springer, Berlin, 1978.
13. J.I. Seiferas, R. McNaughton, Regularity preserving relations, Theoret. Comput. Sci. 2 (1976) 147-154.
14. M.P. Schützenberger, On the definition of a family of automata, Inform. Control 4 (1961) 245-270.
15. R.E. Stearns, J. Hartmanis, Regularity preserving modifications of regular expressions, Inform. Control 6 (1963) 55-69.
16. G.-Q. Zhang, Automata, Boolean matrices, and ultimate periodicity, Inform. Comput. 152 (1999) 138-154.
17. U. Zimmermann, Linear and Combinatorial Optimization in Ordered Algebraic Structures, Annals of Discrete Mathematics, vol. 10, North-Holland, Amsterdam, 1981.