Recognizable tree series with discounting

Authors:
Eleni Mandrali;George Rahonis
Affiliations:
Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki, Greece
Venue:
Acta Cybernetica
Year:
2009

Citing 23
Cited 2

Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness

Journal of the ACM (JACM) - The MIT Press scientific computation series
Weighted grammars and Kleene's theorem

Information Processing Letters
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Finite tree automata with cost functions

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
Tree automata for code selection

Acta Informatica
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Competitive Markov decision processes

Competitive Markov decision processes
Languages, automata, and logic

Handbook of formal languages, vol. 3
Model-checking infinite state-space systems with fine-grained abstractions using SPIN

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Algebraic Semantics

Algebraic Semantics
Automata Theory and Its Applications

Automata Theory and Its Applications
Stochastic k-testable Tree Languages and Applications

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
A Kleene Theorem for Weighted Tree Automata

Theory of Computing Systems
Skew and infinitary formal power series

Theoretical Computer Science
Weighted tree automata and weighted logics

Theoretical Computer Science
Weighted automata and weighted logics

Theoretical Computer Science
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables

Theory of Computing Systems
Weighted automata with discounting

Information Processing Letters
Weighted automata and weighted logics with discounting

Theoretical Computer Science
Smoothing and compression with stochastic k-testable tree languages

Pattern Recognition
Discounting the future in systems theory

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Weighted muller tree automata and weighted logics

Journal of Automata, Languages and Combinatorics
Code selection by tree series transducers

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Weighted tree automata over valuation monoids and their characterization by weighted logics

Algebraic Foundations in Computer Science
Equational weighted tree transformations with discounting

Algebraic Foundations in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider weighted tree automata with discounting over commutative semirings. For their behaviors we establish a Kleene theorem and an MSOlogic characterization. We introduce also weighted Muller tree automata with discounting over the max-plus and the min-plus semirings, and we show their expressive equivalence with two fragments of weighted MSO-sentences.