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

DOI10.1016/J.TCS.2004.07.005MaRDI QIDQ703495zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Branching automata with costs -- a way of reflecting parallelism in costs
• scientific article; zbMATH DE number 1722707
• Parallelization of automata
• On the cost of simulating a parallel Boolean automata network by a block-sequential one
• The parallel complexity of finite-state automata problems
• Finite tree automata with cost functions
• Towards automata for branching time and partial order
• On Parallel Implementations of Deterministic Finite Automata
• scientific article; zbMATH DE number 4051013
• scientific article; zbMATH DE number 1419219

Cites work

• scientific article; zbMATH DE number 3932372 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 2038728 (Why is no real title available?)
• scientific article; zbMATH DE number 1504580 (Why is no real title available?)
• Branching automata with costs -- a way of reflecting parallelism in costs
• Kleene's theorem for weighted tree-automata.
• On the definition of a family of automata
• Rationality in algebras with a series operation
• 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.
• The equational theory of pomsets
• Towards a language theory for infinite N-free pomsets.

Cited in

(6)

• On weighted Petri net transducers
• Definable transductions and weighted logics for texts
• Branching automata with costs -- a way of reflecting parallelism in costs
• Valuations of weighted automata: doing it in a rational way
• Modeling quantitative aspects of concurrent systems using weighted Petri net transducers
• Schützenberger's theorem on formal power series follows from Kleene's theorem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703495)