Branching automata with costs -- a way of reflecting parallelism in costs

DOI10.1016/j.tcs.2004.07.005zbMath1071.68044OpenAlexW2110578408MaRDI QIDQ703495

Dietrich Kuske, Ingmar Meinecke

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.005

zbMATH Keywords

ConcurrencyFormal power seriesBisemiringsp-posetsWeighted automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Definable transductions and weighted logics for texts ⋮ Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers ⋮ Schützenberger's theorem on formal power series follows from Kleene's theorem ⋮ On Weighted Petri Net Transducers ⋮ Valuations of Weighted Automata: Doing It in a Rational Way

Cites Work

• The equational theory of pomsets
• Recognizable formal power series on trees
• Series-parallel languages and the bounded-width property
• The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
• Rationality in algebras with a series operation
• Towards a language theory for infinite N-free pomsets.
• On the definition of a family of automata
• Branching Automata with Costs — A Way of Reflecting Parallelism in Costs
• Fundamentals of Computation Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Branching automata with costs -- a way of reflecting parallelism in costs