Semirings, automata, languages
Semirings, automata, languages
Rational series and their languages
Rational series and their languages
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Skew and infinitary formal power series
Theoretical Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Expressiveness and Closure Properties for Quantitative Languages
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Handbook of Weighted Automata
Fuzzy Sets and Systems
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Valuations of weighted automata: doing it in a rational way
Algebraic Foundations in Computer Science
| Hi-index | 0.00 |
Quantitative aspects of systems like consumption of resources, output of goods, or reliability can be modeled by weighted automata. Recently, objectives like the average cost or the longtime peak power consumption of a system have been modeled by weighted automata which are not semiring weighted anymore. Instead, operations like limit superior, limit average, or discounting are used to determine the behavior of these automata. Here, we introduce a new class of weight structures subsuming a range of these models as well as semirings. Our main result shows that such weighted automata and Kleene-type regular expressions are expressively equivalent both for finite and infinite words.