Handbook of theoretical computer science (vol. B)
Finite Automata Computing Real Functions
SIAM Journal on Computing
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
On the Determinization of Weighted Finite Automata
SIAM Journal on Computing
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
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables
Theory of Computing Systems
Weighted automata with discounting
Information Processing Letters
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 Picture Automata and Weighted Logics
Theory of Computing Systems
Weighted muller tree automata and weighted logics
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
Recognizable tree series with discounting
Acta Cybernetica
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Models for quantitative distributed systems and multi-valued logics
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
Equational weighted tree transformations with discounting
Algebraic Foundations in Computer Science
Valuations of weighted automata: doing it in a rational way
Algebraic Foundations in Computer Science
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
Automatic vandalism detection in wikipedia with active associative classification
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
Weighted modal transition systems
Formal Methods in System Design
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Regular Functions and Cost Register Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |
We introduce a weighted logic with discounting and we establish the Buchi-Elgot theorem for weighted automata over finite words and arbitrary commutative semirings. Then we investigate Buchi and Muller automata with discounting over the max-plus and the min-plus 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.