Combinatorics on traces
Asynchronous mappings and asynchronous cellular automata
Information and Computation
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
The "Last" Decision Problem for Rational Trace Languages
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Weighted asynchronous cellular automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Realizability of Concurrent Recursive Programs
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Models for quantitative distributed systems and multi-valued logics
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 5.23 |
We study weighted systems whose behavior is described as a formal power series over a free partially commutative or trace monoid. It is shown that the interleaving approach and the distributed approach are equivalent in this setting. This holds, both in the deterministic and in the nondeterministic case. Consequently, we obtain a particularly simple class of sequential weighted automata that already have full expressive power.