Skew and Infinitary Formal Power Series

We investigate finite-state systems with costs. Departing from classical theory, in this paper the cost of an action does not only depend on the state of the system, but also on the time when it is executed. We first characterize the terminating behaviors of such systems in terms of rational formal power series. This generalizes a classical result of Schutzenberger. Using the previous results, we also deal with nonterminating behaviors and their costs. This includes an extension of the Buchi-acceptance condition from finite automata to weighted automata and provides a characterization of these nonterminating behaviors in terms of ω-rational formal power series. This generalizes a classical theorem of Buchi.

[1]  U. Zimmermann.  Linear and combinatorial optimization in ordered algebraic structures , 1981 .

[2]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[3]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[4]  Rüdiger Göbel,et al.  All infinite groups are Galois groups over any field , 1987 .

[5]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[6]  Raffaele Giancarlo,et al.  On the Determinization of Weighted Finite Automata , 2000, SIAM J. Comput..

[7]  Karel Culik,et al.  Finite Automata Computing Real Functions , 1994, SIAM J. Comput..

[8]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[9]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[10]  O. Ore.  Theory of Non-Commutative Polynomials , 1933 .

[11]  Stéphane Gaubert,et al.  Rational series over dioids and discrete event systems , 1994 .

[12]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[13]  Helmut Jürgensen,et al.  Image texture analysis using weighted finite automata , 2003 .

[14]  Jarkko Kari,et al.  Image compression using weighted finite automata , 1993, Comput. Graph..

[15]  Manuel Bronstein,et al.  An Introduction to Pseudo-Linear Algebra , 1996, Theor. Comput. Sci..

[16]  Thomas A. Henzinger,et al.  Discounting the Future in Systems Theory , 2003, ICALP.

[17]  Manfred Droste,et al.  Recognizable and Rational Formal Power Series with General Discounting , 2003 .

[18]  Paul Gastin,et al.  The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables , 1999, Inf. Comput..

[19]  R. Cuninghame-Green.  Minimax Algebra and Applications , 1994 .

[20]  Stéphane Gaubert,et al.  Methods and Applications of (MAX, +) Linear Algebra , 1997, STACS.

[21]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[22]  André Galligo,et al.  Some Algorithmic Questions of Constructing Standard Bases , 1985, European Conference on Computer Algebra.

[23]  Arto Salomaa,et al.  Semirings, Automata and Languages , 1985 .

[24]  Mehryar Mohri,et al.  The Design Principles of a Weighted Finite-State Transducer Library , 2000, Theor. Comput. Sci..

[25]  Werner Kuich,et al.  Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata , 1997, Handbook of Formal Languages.

[26]  W. Kuich,et al.  The degree of distinguishability of stochastic sequential machines and related problems. , 2005 .

[27]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[28]  André Galligo,et al.  Some algorithmic questions on ideals of differential operators , 1985 .

[29]  Zhuhan Jiang,et al.  Similarity Enrichment in Image Compression through Weighted Finite Automata , 2000, COCOON.