Branching automata with costs -- a way of reflecting parallelism in costs
type: Item
instance of: scholarly article
title: Branching automata with costs -- a way of reflecting parallelism in costs
zbMATH Open document ID: 1071.68044
author: Dietrich Kuske
author: Ingmar Meinecke
published in: Theoretical Computer Science
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 2126084
zbMATH Keywords: Concurrency
zbMATH Keywords: Weighted automata
zbMATH Keywords: sp-posets
zbMATH Keywords: Formal power series
zbMATH Keywords: Bisemiring
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.07.005
OpenAlex ID: W2110578408
cites work: Recognizable formal power series on trees
cites work: Q3994777
cites work: The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
cites work: Q4502531
cites work: Q4449193
cites work: The equational theory of pomsets
cites work: Q3922196
cites work: Q3704880
cites work: Towards a language theory for infinite N-free pomsets.
cites work: Branching Automata with Costs — A Way of Reflecting Parallelism in Costs
cites work: Series-parallel languages and the bounded-width property
cites work: Rationality in algebras with a series operation
cites work: Fundamentals of Computation Theory
cites work: Q4155837
cites work: On the definition of a family of automata
DOI: 10.1016/J.TCS.2004.07.005
Recommended article: Branching Automata with Costs — A Way of Reflecting Parallelism in Costs
Recommended article: Q2778879
Recommended article: Parallelization of automata
Recommended article: On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One
Recommended article: The parallel complexity of finite-state automata problems
Recommended article: Finite tree automata with cost functions
Recommended article: Towards automata for branching time and partial order
Recommended article: On Parallel Implementations of Deterministic Finite Automata
Recommended article: Q3787499
Recommended article: Q4942237
description: scientific article; zbMATH DE number 2126084