# A unifying survey on weighted logics and weighted automata

## Abstract

Logical formalisms equivalent to weighted automata have been the topic of numerous research papers in the recent years. It started with the seminal result by Droste and Gastin on weighted logics over semirings for words. It has been extended in two dimensions by many authors. First, the weight domain has been extended to valuation monoids, valuation structures, etc. to capture more quantitative properties. Along another dimension, different structures such as ranked or unranked trees, nested words, Mazurkiewicz traces, etc. have been considered. The long and involved proofs of equivalences in all these papers are implicitly based on the same core arguments. This article provides a meta-theorem which unifies these different approaches. Towards this, we first revisit weighted automata by defining a new semantics for them in two phases—an abstract semantics based on multisets of weight structures (independent of particular weight domains) followed by a concrete semantics. Then, we introduce a core weighted logic with a minimal number of features and a simplified syntax, and lift the new semantics to this logic. We show at the level of the abstract semantics that weighted automata and core weighted logic have the same expressive power. Finally, we show how previous results can be recovered from our result by logical reasoning. In this paper, we prove the meta-theorem for words, ranked and unranked trees, showing the robustness of our approach.

## Notes

### Compliance with ethical standards

### Conflict of interest

The authors declare that they have no conflict of interest.

## References

- Albert J, Kari J (2009) Digital image compression. In: Kuich W, Vogler H, Droste M (eds) Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, chap. 5. Springer, pp. 445–472Google Scholar
- Bollig B, Gastin P (2009) Weighted versus probabilistic logics. In: Proceedings of the 13th international conference on developments in language theory (DLT’09), Lecture Notes in Computer Science, vol. 5583, Springer, pp. 18–38Google Scholar
- Büchi JR (1960) Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6:66–92MathSciNetCrossRefzbMATHGoogle Scholar
- Černý P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R (2011) Quantitative synthesis for concurrent programs. In: Proceedings of the 23rd international conference on computer aided verification (CAV’11), Lecture Notes in Computer Science, vol 6806, Springer, pp. 243–259Google Scholar
- Comon-Lundh H, Dauchet M, Gilleron R, Jacquemard F, Lugiez D, Tison S, Tommasi M (2008) Tree automata techniques and applications. http://tata.gforge.inria.fr/
- Droste M, Gastin P (2007) Weighted automata and weighted logics. Theor Comput Sci 380(1–2):69–86Google Scholar
- Droste M, Götze D, Märcker S, Meinecke I (2011) Weighted tree automata over valuation monoids and their characterization by weighted logics. In: Algebraic Foundations in Computer Science, Lecture Notes in Computer Science, vol 7020, Springer, pp. 30–55Google Scholar
- Droste M, Heusel D, Vogler H (2015) Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics. In: Proceedings of the 6th international conference on algebraic informatics (CAI’15), Lecture Notes in Computer Science, vol 9270, Springer, pp. 90–102Google Scholar
- Droste M, Kuich W (2009) Semirings and formal power series. In: Droste M, Kuich W, Vogler H (eds) Handbook of weighted automata, EATCS monographs in theoretical computer science, chap. 1, Springer, pp. 3–27Google Scholar
- Droste M, Meinecke I (2012) Weighted automata and weighted MSO logics for average and long-time behaviors. Inf Comput 220–221:44–59MathSciNetCrossRefzbMATHGoogle Scholar
- Droste M, Perevoshchikov V (2013) Multi-weighted automata and MSO logic. In: Proceedings of the 8th international computer science symposium in Russia (CSR’13), Lecture Notes in Computer Science. vol. 7913, Springer, pp 418–430Google Scholar
- Droste M, Perevoshchikov V (2014) A Nivat theorem for weighted timed automata and weighted relative distance logic. In: Proceedings of the 41st international colloquium on automata, languages and programming (ICALP’14), Lecture Notes in Computer Science, vol. 8573, Springer, pp. 171–182Google Scholar
- Droste M, Vogler H (2006) Weighted tree automata and weighted logics. Theor Comput Sci 366(3):228–247MathSciNetCrossRefzbMATHGoogle Scholar
- Droste M, Vogler H (2011) Weighted logics for unranked tree automata. Theory Comput Syst 48:23–47MathSciNetCrossRefzbMATHGoogle Scholar
- Elgot CC (1961) Decision problems of finite automata design and related arithmetics. Trans Am Math Soc 98:21–52MathSciNetCrossRefzbMATHGoogle Scholar
- Fülöp Z, Stüber T, Vogler H (2012) A Büchi-like theorem for weighted tree automata over multioperator monoids. Theory Comput Syst 50:241–278MathSciNetCrossRefzbMATHGoogle Scholar
- Knight K, May J (2009) Applications of weighted automata in natural language processing. In: Droste M, Kuich W, Vogler H (eds) Handbook of weighted automata, EATCS monographs in theoretical computer science, chap. 14, Springer, pp 555–579Google Scholar
- Kuich W, Salomaa A (1985) Semirings. Automata and Languages. EATCS Monographs in Theoretical Computer Science. Springer-VerlagGoogle Scholar
- Perevoshchikov V (2015) Multi-weighted automata models and quantitative logics. Ph.D. thesis, Universität LeipzigGoogle Scholar
- Schützenberger MP (1961) On the definition of a family of automata. Inf Control 4:245–270MathSciNetCrossRefzbMATHGoogle Scholar
- Thatcher JW, Wright JB (1968) Generalized finite automata theory with an application to a decision problem of second-order logic. Math Syst Theory 2(1):57–81MathSciNetCrossRefzbMATHGoogle Scholar
- Trakhtenbrot BA (1961) Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSSR 149:326–329Google Scholar