Semirings, automata, languages
Semirings, automata, languages
Handbook of theoretical computer science (vol. B)
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Finite Automata Computing Real Functions
SIAM Journal on Computing
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Competitive Markov decision processes
Competitive Markov decision processes
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
Symbolic Model Checking
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata Theory and Its Applications
Automata Theory and Its Applications
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Computational Linguistics
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
Discounting the future in systems theory
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
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 on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Weighted automata with discounting
Information Processing Letters
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Definable transductions and weighted logics for texts
Theoretical Computer Science
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
| Hi-index | 0.00 |
We introduce a weighted logic with discounting and we establish Büchi's and Elgot's theorem for weighted automata over finite words and arbitrary commutative semirings. Then we investigate Büchi and Muller automata with discounting over the max-plus and the minplus semiring. We show their expressive equivalence with weighted MSO-sentences with discounting. In this case our logic has a purely syntactic definition. For the finite case, we obtain a purely syntactically defined weighted logic if the underlying semiring is additively locally finite.