Semirings, automata, languages
Semirings, automata, languages
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Rational series and their languages
Rational series and their languages
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Partial commutation and traces
Handbook of formal languages, vol. 3
The Kleene-Schützenberger theorem for formal power series in partially commuting variables
Information and Computation
The Book of Traces
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Branching automata with costs: a way of reflecting parallelism in costs
Theoretical Computer Science - Implementation and application of automata
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Weighted picture automata and weighted logics
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Weighted asynchronous cellular automata
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
On the expressiveness of asynchronous cellular automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Weighted automata and weighted logics
Theoretical Computer Science
Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Weighted Logics for Nested Words and Algebraic Formal Power Series
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Definable transductions and weighted logics for texts
Theoretical Computer Science
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
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
MSO logics for weighted timed automata
Formal Methods in System Design
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
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
| Hi-index | 0.00 |
We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series with those which are definable by restricted formulas from a weighted logics over traces. We use a translation technique from formulas over words to those over traces, and vice versa. This way, we show also the equivalence of aperiodic and first-order definable trace series.