On aperiodic and star-free formal power series in partially commuting variables

DOI10.1007/s00224-007-9064-zzbMath1140.68032OpenAlexW1994329670MaRDI QIDQ927397

Manfred Droste, Paul Gastin

Publication date: 6 June 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9064-z

zbMATH Keywords

SemiringTracesFormal power seriesWeighted automataAperiodic languagesStar-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (6)

Weighted automata and weighted logics with discounting ⋮ Weighted Automata and Weighted Logics ⋮ Modelling Uncertainty in Architectures of Parametric Component-Based Systems ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Weighted automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Series formelles et algèbres syntactiques
• Linear and combinatorial optimization in ordered algebraic structures
• Combinatorics on traces
• Star-free trace languages
• On finite semigroups of matrices
• The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
• Aperiodic languages in concurrency monoids
• Weighted automata and weighted logics
• On the definition of a family of automata
• On finite monoids having only trivial subgroups

This page was built for publication: On aperiodic and star-free formal power series in partially commuting variables