T-structures, T-functions, and texts
Theoretical Computer Science
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Acta Informatica
Text languages in an algebraic framework
Fundamenta Informaticae - Special issue on formal language theory
Formal languages over free binoids
Journal of Automata, Languages and Combinatorics
Journal of Automata, Languages and Combinatorics
Weighted tree automata and weighted logics
Theoretical Computer Science
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted picture automata and weighted logics
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Weighted Logics for Nested Words and Algebraic Formal Power Series
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Note: Existential MSO over two successors is strictly weaker than over linear orders
Theoretical Computer Science
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Definable transductions and weighted logics for texts
Theoretical Computer Science
Weighted automata and weighted logics with discounting
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Varieties of recognizable tree series over fields
Theoretical Computer Science
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
MSO logics for weighted timed automata
Formal Methods in System Design
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
| Hi-index | 0.00 |
A text is a word together with an additional linear order on it. We study quantitative models for texts, i. e. text series which assign to texts elements of a semiring. We consider an algebraic notion of recognizability following Reutenauer and Bozapalidis and show that recognizable text series coincide with text series definable in weighted logics as introduced by Droste and Gastin. In order to do so, we study certain definable transductions and show that they are compatible with weighted logics. Moreover, we show that the behavior of weighted parenthesizing automata coincides with certain definable series.