Journal of the ACM (JACM) - The MIT Press scientific computation series
Handbook of theoretical computer science (vol. B)
Generalized automata on infinite trees and Muller-McNaughton's theorem
Theoretical Computer Science
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
Acta Informatica
Finite Automata Computing Real Functions
SIAM Journal on Computing
Tree automata for code selection
Acta Informatica
Semirings and formal power series: their relevance to formal languages and automata
Handbook of formal languages, vol. 1
Languages, automata, and logic
Handbook of formal languages, vol. 3
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Journal of Computer and System Sciences
Information Sciences—Informatics and Computer Science: An International Journal
Algebraic Semantics
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata Theory and Its Applications
Automata Theory and Its Applications
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)
A Kleene Theorem for Weighted Tree Automata
Theory of Computing Systems
Weighted tree automata and weighted logics
Theoretical Computer Science
Fuzzy regular languages over finite and infinite words
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Skew and infinitary formal power series
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
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
Code selection by tree series transducers
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Definable transductions and weighted logics for texts
Theoretical Computer Science
Recognizable tree series with discounting
Acta Cybernetica
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
| Hi-index | 0.00 |
We introduce weighted Muller tree automata, over totally commutative complete semirings, acting on infinite trees. We show that their behaviours coincide with the semantics of weighted restricted MSO-sentenees and the semantics of weighted incomplete universal MSO-sentences, provided that the underlying semiring is idempotent.