Academia.eduAcademia.edu

Outline

Title
Abstract
References
All Topics
Computer Science
Theoretical Computer Science

Weighted Automata: Theory and Applications Preface

Profile image of Manfred DrosteManfred Droste

Theoretical Computer Science

https://doi.org/10.1016/J.TCS.2014.02.031
visibility

…

description

46 pages

link

1 file

Abstract

This report contains the program and the abstracts of lectures delivered at the workshop "Weighted Automata-Theory and Applications" which took place at Leipzig University, March 27-31, 2006. This workshop covered all aspects of weighted automata, ranging from the theory of formal power series to quantum automata and applications e.g. in digital image processing or model-checking of probabilistic systems. The workshop was attended by 45 participants from countries. Two tutorials were given by J. Albert (Würzburg), J. Gruska (Brno).

Related papers

Weighted Automata over Vector Spaces
Miroslav Ciric

Electronic Proceedings in Theoretical Computer Science

In this paper we deal with three models of weighted automata that take weights in the field of real numbers. The first of these models are classical weighted finite automata, the second one are crispdeterministic weighted automata, and the third one are weighted automata over a vector space. We explore the interrelationships between weighted automata over a vector space and other two models.

View PDFchevron_right
On the Determinization of Weighted Finite Automata
Jeffery Westbrook

SIAM Journal on Computing, 2000

We study the problem of constructing the deterministic equivalent of a nondeterministic weighted finite-state automaton (WFA). Determinization of WFAs has important applications in automatic speech recognition (ASR). We provide the first polynomial-time algorithm to test for the twins property, which determines if a WFA admits a deterministic equivalent. We also give upper bounds on the size of the deterministic equivalent;

View PDFchevron_right
On continuous weighted finite automata
Paula Steinby

Linear Algebra and its Applications, 2012

We investigate the continuity of the ω-functions and real functions defined by weighted finite automata (WFA). We concentrate on the case of average preserving WFA. We show that every continuous ω-function definable by some WFA can be defined by an average preserving WFA and then characterize minimal average preserving WFA whose ω-function or ω-function and real function are continuous. We obtain several algorithmic reductions for WFA-related decision problems. In particular, we show that deciding whether the ω-function and real function of an average preserving WFA are both continuous is computationally equivalent to deciding stability of a set of matrices. We also present a method for constructing WFA that compute continuous real functions.

View PDFchevron_right
Weighted register automata and weighted logic on data words
Manfred Droste

Theoretical Computer Science, 2018

View PDFchevron_right
A coalgebraic perspective on linear weighted automata
Marcello Bonsangue

Information and Computation, 2012

Weighted automata are a generalization of non-deterministic automata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for non-deterministic automata, their behaviours can be expressed in terms of either (weighted) bisimilarity or (weighted) language equivalence.

View PDFchevron_right
Equations and Coequations for Weighted Automata
Julian Salamanca

Lecture Notes in Computer Science, 2015

We study weighted automata from both an algebraic and a coalgebraic perspective. In particular, we consider equations and coequations for weighted automata. We prove a duality result that relates sets of equations (congruences) with (certain) subsets of coequations. As a consequence, we obtain two equivalent but complementary ways to define classes of weighted automata. We show that this duality cannot be generalized to linear congruences in general but we obtain partial results when weights are from a field. i∈I {i} × X i. We will construct the Moore automaton cofree w (X, α) by taking the following steps:

View PDFchevron_right
Weighted tree automata and weighted logics
Manfred Droste

Theoretical Computer Science, 2006

We define a weighted monadic second order logic for trees where the weights are taken from a commutative semiring. We prove that a restricted version of this logic characterizes the class of formal tree series which are accepted by weighted bottom-up finite state tree automata. The restriction on the logic can be dropped if additionally the semiring is locally finite. This generalizes corresponding classical results of Thatcher, Wright, and Doner for tree languages and it extends recent results of Droste and Gastin [Weighted automata and weighted logics, informal power series on words to formal tree series.

View PDFchevron_right
Determinization of weighted finite automata over strong bimonoids
Manfred Droste

Information Sciences, 2010

We consider weighted finite automata over strong bimonoids, where these weight structures can be considered as semirings which might lack distributivity. Then, in general, the well-known run semantics, initial algebra semantics, and transition semantics of an automaton are different. We prove an algebraic characterization for the initial algebra semantics in terms of stable finitely generated submonoids. Moreover, for a given weighted finite automaton we construct the Nerode automaton and Myhill automaton, both being crisp-deterministic, which are equivalent to the original automaton with respect to the initial algebra semantics, resp., the transition semantics. We prove necessary and sufficient conditions under which the Nerode automaton and the Myhill automaton are finite, and we provide efficient algorithms for their construction. Also, for a given weighted finite automaton, we show sufficient conditions under which a given weighted finite automaton can be determinized preserving its run semantics. and weighted tree automata over strong bimonoids begun in respectively . As usual, there are three different definitions of the behavior of such automata: the run semantics , the initial algebra semantics , and the transition semantics . In the run semantics, the weight of a word w is computed by summing up the weights of all successful runs of A on w where the weight of a run is the product of the weights of the involved transitions. For the other two semantics, we associate with each input symbol an n × n-matrix of transition weights assuming that A has n states. In both semantics, we multiply the vector of initial weights with the matrices corresponding to the symbols of w and with the final weight vector, but the sequence of these multiplications differs in the two semantics. In the case of semirings, these three semantics coincide for every weighted finite automaton. In contrast to this, we show by an easy example that over the unit interval with bounded sum these three semantics in general differ.

View PDFchevron_right
Pumping Lemmas for Weighted Automata
Cristian Riveros

Leibniz International Proceedings in Informatics (LIPIcs), 2018

We present three pumping lemmas for three classes of functions definable by fragments of weighted automata over the min-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of functions definable by unambiguous, finitely-ambiguous, polynomially-ambiguous weighted automata, and the full class of weighted automata is strict for the min-plus semiring. 2012 ACM Subject Classification Theory of computation → Models of computation

View PDFchevron_right
Aperiodic Weighted Automata and Weighted First-Order Logic
Manfred Droste

2019

By fundamental results of Sch\"utzenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivalence to a quantitative setting. For this, weighted automata form a general and widely studied model. We define a suitable notion of a weighted first-order logic. Then we show that this weighted first-order logic and aperiodic polynomially ambiguous weighted automata have the same expressive power. Moreover, we obtain such equivalence results for suitable weighted sublogics and finitely ambiguous or unambiguous aperiodic weighted automata. Our results hold for general weight structures, including all semirings, average computations of costs, bounded lattices, and others.

View PDFchevron_right

References (50)

  1. M. Droste and P. Gastin. Weighted automata and weighted logics. In Au- tomata, Languages and Programming (32nd ICALP, Lissabon), volume 3580 of Lecture Notes in Comp. Sc., pages 513-525. Springer, 2005. Work partly supported by the DAAD-PROCOPE project Temporal and Quantita- tive Analysis of Distributed Systems. References
  2. M. Droste and P. Gastin. The Kleene-Schützenberger theorem for formal power series in partially commuting variables. Information and Computation, 153:47-80, 1999.
  3. M. Droste and P. Gastin. On aperiodic and star-free formal power series in partially commuting variables. In Formal Power Series and Algebraic Combinatorics (Moscow 2000), pages 158-169. Springer Berlin, 2000.
  4. D. Kuske and I. Meinecke. Branching automata with costs -a way of reflecting paral- lelism in costs. Theoret. Comp. Sc., 328:53-75, 2004.
  5. D. Kuske. Weighted asynchronous cellular automata. In STACS 2006, volume 3884 of Lecture Notes in Comp. Sc., pages 685-696. Springer, 2006.
  6. I. Meinecke. The Hadamard product of sequential-parallel series. J. of Automata, Languages and Combinatorics, 10(2), 2005. To appear.
  7. I. Meinecke. Weighted logics for traces. In Intern. Computer Science Symposium in Russia (CSR) 2006, Lecture Notes in Comp. Sc. Springer, 2006. accepted. References
  8. M. Droste, G. Rahonis, Weighted automata and weighted logics over infinite words (submitted).
  9. M. Droste, H. Vogler, Weighted Tree Automata and Weighted Logics (sub- mitted).
  10. Z. Ésik, W. Kuich, A semiring-semimodule generalization of ω-regular lan- guages I, II. Special issue on "Weighted automata" (M. Droste, H. Vogler, eds.) J. of Automata Languages and Combinatorics, to appear. Technical Contributions A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata Daniel Kirsten Dresden University of Technology, Institute of Algebra, 01062 Dresden, Germany http://www.math.tu-dresden.de/∼kirsten/ References
  11. D. Kirsten. A Burnside approach to the termination of Mohri's algorithm for polynomially ambiguous min-plus-automata. (Manuscript, available under www.math.tu-dresden.de/~kirsten/publications/), 2005.
  12. M. Mohri. Finite-state transducers in language and speech processing. Computa- tional Linguistics, 23:269-311, 1997.
  13. Björn Borchardt. The Theory of Recognizable Tree Series. Verlag für Wissenschaft und Forschung, 2005. published Ph.D. thesis.
  14. J. Engelfriet, Z. Fülöp, and H. Vogler. Bottom-up and top-down tree series trans- formations. J. Automata, Languages and Combinatorics, 7:11-70, 2002.
  15. Z. Fülöp and H. Vogler. Tree series transformations that respect copying. Theory of Computing Systems, 36(3):247-293, 2003.
  16. W. Kuich. Tree transducers and formal tree series. Acta Cybernet., 14:135-149, 1999.
  17. W. Kuich. Full Abstract Families of Tree Series II. In R. Freund and A. Kelemen- ova, editors, Proceedings of the International Workshop Grammar Systems 2000, pages 347-358, 2000.
  18. Manfred Droste and Paul Gastin. The Kleene-Schützenberger theorem for formal power series in partially commuting variables. Information and Computation, 153:47- 80, 1999.
  19. Manfred Droste and Dietrich Kuske. Skew and infinitary formal power series. In Proceedings of ICALP'03, volume 2719 of Lecture Notes in Computer Science, pages 426-438. Springer, 2003. References
  20. S. Bozapalidis and A. Grammatikopoulou. Recognizable picture series. In M. Droste and H. Vogler, editors, Special issue on Weighted Automata, presented at WATA 2004, Dresden, Journal of Automata, Languages and Combinatorics, 2005. In print.
  21. M. Droste and P. Gastin. Weighted automata and logics. In 32nd ICALP, volume 3580 of Lecture Notes in Computer Science, pages 513-525. Springer, 2005.
  22. K. S. Fu. Syntactic Methods in Pattern Recognition. Academic Press, New York, 1974.
  23. D. Giammarresi and A. Restivo. Two-dimensional languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 215-267. Springer, Berlin, 1997.
  24. D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas. Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Inform. and Comput., 125:32-45, 1996.
  25. K. Inoue and A. Nakamura. Some properties of two-dimensional on-line tessellation acceptors. Information Sciences, 13:95-121, 1977.
  26. K. Lindgren, C. Moore, and M. Nordahl. Complexity of two-dimensional patterns. Journal of Statistical Physics, 91(5-6):909-951, 1998.
  27. I. Mäurer. Recognizable and rational picture series. In Conference on Algebraic Informatics, pages 141-155. Aristotle University of Thessaloniki Press, 2005.
  28. I. Mäurer. Weighted picture automata and weighted logics. In B. Durand and W. Thomas, editors, STACS 2006, volume 3885 of Lecture Notes in Computer Science, pages 313-324. Springer Berlin, 2006.
  29. M. Minski and S. Papert. Perceptron. M.I.T. Press, Cambridge, Mass., 1969.
  30. R.A. Smith. Two-dimensional formal languages and pattern recognition by cellular automata. 12th IEEE FOCS Conference Record, pages 144-152, 1971. References
  31. Antonio Di Nola and Brunella Gerla. Algebras of Lukasiewicz logic and their semiring reducts. Technical report, Erwin Schrödinger International Institute for Mathematical Physics, Wien, 2004.
  32. Manfred Droste and Paul Gastin. Weighted automata and weighted logics. In Pro- ceedings of the 32nd International Colloquium on Automata, Languages and Pro- gramming (ICALP'05), Lecture Notes in Computer Science, Lisboa, Portugal, July 2005. Springer.
  33. Siegfried Gottwald. A Treatise on Many-Valued Logics, volume 9 of Studies in Logic and Computation. Research Studies Press, Baldock, November 2000.
  34. Julius Richard Büchi. Weak second order arithmetic and finite automata. Z. Math. Logik Grundlagen Math., 6:66-92, 1960.
  35. K. Culik II, J. Karhumäki, Finite automata computing real functions. SIAM Journal on Computing 23/4 (1994), 789-814.
  36. J. Albert, J. Kari, Parametric Weighted Finite Automata and Iterated Function Systems. Proc. L'Ingenieur et les Fractales -Fractals in Engineer- ing, Delft. 1999, 248-255.
  37. G. Tischler, Real Functions computed by Parametric Weighted Finite Automata. Proc. Conference on Algebraic Informatics, Thessaloniki. 2005, 129-138.
  38. G. Tischler Properties and Applications of Parametric Weighted Finite Automata. Accepted for publication in JALC. 2005.
  39. K. Culik II, J. Kari, Image Compression Using Weighted Finite Au- tomata, Computer and Graphics 17/3 (1993), 305-313.
  40. K. Culik II, J. Kari, Image-data compression using edge-optimizing al- gorithm for WFA inference Journal of Information Processing and Manage- ment 30 (1994), 829-838.
  41. K. Culik II, J. Kari, Efficient inference algorithm for weighted finite automata in: Fractal Image Encoding and Compression (Ed. Y. Fisher), (1995), Springer-Verlag.
  42. Lorenz Fries: Chronik der Bischöfe von Würzburg -Die Prachthandschrift des Fürstbischofs Julius Echter als Multimedia-DVD, Universitätsbibliothek Würzburg, 2004. Figure 1: Frames of page-flip video taken from [4].
  43. References
  44. N. Dershowitz and R. Treinen. An on-line problem database. In T. Nipkow (Ed.), Proc. 9th Int. Conf. Rewriting Techniques and Applications RTA-98, Lecture Notes in Comput. Sci. Vol. 1379, pp. 332-342. Springer-Verlag, 1998.
  45. L. Fuchs. Partially ordered algebraic systems. Pergamon Press, Oxford, 1963.
  46. N. Dershowitz and R. Treinen. The RTA list of open problems. http://www.lsv. ens-cachan.fr/rtaloop/
  47. N. Eén and A. Biere. Effective preprocessing in SAT through variable and clause elimination. In F. Bacchus and T. Walsh, Proc. 8th Int. Conf. Theory and Applica- tions of Satisfiability Testing SAT 2005, Lecture Notes in Comput. Sci. Vol. 3569, pp. 61-75. Springer-Verlag, 2005.
  48. A. Geser, D. Hofbauer and J. Waldmann. Match-bounded string rewriting systems. Appl. Algebra Engrg. Comm. Comput., 15(3-4):149-171, 2004.
  49. H. Zantema. Termination. In Terese, Term Rewriting Systems, pp. 181-259. Cam- bridge Univ. Press, 2003.
  50. H. Zantema. Problem #104. In [3], http://www.lsv.ens-cachan.fr/rtaloop/ problems/104.html, 2005.

Related papers

Weighted Automata: Theory and Applications which took place at Technische Universität
Manfred Droste

2012

This report contains the programme and the abstracts of lectures delivered at the workshop

View PDFchevron_right
Weighted automata and weighted logics
Manfred Droste

Theoretical Computer Science, 2007

Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour of such an automaton is a mapping, called a formal power series, assigning to each word a weight in some semiring. We generalize Büchi's and Elgot's fundamental theorems to this quantitative setting. We introduce a weighted version of MSO logic and prove that, for commutative semirings, the behaviours of weighted automata are precisely the formal power series definable with particular sentences of our weighted logic. We also consider weighted first-order logic and show that aperiodic series coincide with the first-order definable ones, if the semiring is locally finite, commutative and has some aperiodicity property.

View PDFchevron_right
The Validity of Weighted Automata
Jacques Sakarovitch

International Journal of Algebra and Computation, 2013

This paper addresses the problem of the validity of weighted automata in which the presence of ε-circuits results in infinite summations. Earlier works either rule out such automata or characterize the semirings in which these infinite sums are all well-defined. By means of a topological approach, we take here a definition of validity that is strong enough to insure that in any kind of semirings, any closure algorithm will succeed on every valid weighted automaton and turn it into an equivalent proper automaton. This definition is stable with respect to natural transformations of automata. The classical closure algorithms, in particular algorithms based on the computation of the star of the matrix of ε-transitions, cannot be used to decide validity. This decision problem remains open for general topological semirings. We present a closure algorithm that yields a decision procedure for the validity of automata in the case where the weights are taken in ℚ or ℝ, two cases that had neve...

View PDFchevron_right
Weighted automata
Manfred Droste

Handbook of Automata Theory, 2021

Weighted automata are classical finite automata in which the transitions carry weights. These weights may model quantitative properties like the amount of resources needed for executing a transition or the probability or reliability of its successful execution. Using weighted automata, we may also count the number of successful paths labeled by a given word. As an introduction into this field, we present selected classical and recent results concentrating on the expressive power of weighted automata.

View PDFchevron_right
Weighted Automata–Theory and Applications
Manfred Droste

We extend the disambiguation construction presented by Mohri and Riley [1] in two ways. First we change the underlying structure of their automata from words to trees and second we show that these results hold not only for the tropical semiring but also the arctic one.

View PDFchevron_right

Related topics

  • Theoretical Computer Science
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved