Rational series and their languages
Rational series and their languages
Deciding equivalence of finite tree automata
SIAM Journal on Computing
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
Basic notions of universal algebra for language theory and graph grammars
Theoretical Computer Science
Text languages in an algebraic framework
Fundamenta Informaticae - Special issue on formal language theory
Handbook of formal languages, vol. 3
On rational series and rational languages
Theoretical Computer Science
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Formal languages over free binoids
Journal of Automata, Languages and Combinatorics
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Journal of Computer and System Sciences
MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
Rationality in algebras with a series operation
Information and Computation
On Logics, Tilings, and Automata
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Finite codes over free binoids
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Regular binoid expressions and regular binoid languages
Theoretical Computer Science
On transformations of formal power series
Information and Computation
Journal of Automata, Languages and Combinatorics
Branching automata with costs: a way of reflecting parallelism in costs
Theoretical Computer Science - Implementation and application of automata
Weighted automata and weighted logics
Theoretical Computer Science
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Note: Existential MSO over two successors is strictly weaker than over linear orders
Theoretical Computer Science
Handbook of Weighted Automata
On some questions of rationality and decidability
Journal of Computer and System Sciences
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Definable transductions and weighted logics for texts
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Weighted automata and weighted logics with discounting
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Weighted Logics for Unranked Tree Automata
Theory of Computing Systems
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
Łukasiewicz logic and weighted logics over MV-semirings
Journal of Automata, Languages and Combinatorics
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
Learning multiplicity tree automata
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 5.24 |
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 introduce an algebraic notion of recognizability following Reutenauer and Bozapalidis as well as weighted automata for texts combining an automaton model of Lodaya and Weil with a model of Esik and Nemeth. After that we show that both formalisms describe the text series definable in a certain fragment of 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.