Weighted and unweighted trace automata

Authors:
Dietrich Kuske
Affiliations:
Institut für Informatik, Universität Leipzig
Venue:
Acta Cybernetica
Year:
2009

Citing 10
Cited 0

Semirings, automata, languages

Semirings, automata, languages
Rational series and their languages

Rational series and their languages
The Kleene-Schützenberger theorem for formal power series in partially commuting variables

Information and Computation
Automata, Languages, and Machines

Automata, Languages, and Machines
The Book of Traces

The Book of Traces
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids

Theoretical Computer Science
Note: Schützenberger's theorem on formal power series follows from Kleene's theorem

Theoretical Computer Science
Recognizable languages in divisibility monoids

Mathematical Structures in Computer Science
Handbook of Weighted Automata

Handbook of Weighted Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We reprove Droste & Gastin's characterisation from [3] of the behaviors of weighted trace automata by certain rational expressions. This proof shows how to derive their result on weighted trace automata as a corollary to the unweighted counterpart shown by Ochmanski.