Branching automata with costs -- a way of reflecting parallelism in costs
From MaRDI portal
Publication:703495
DOI10.1016/J.TCS.2004.07.005zbMATH Open1071.68044OpenAlexW2110578408MaRDI QIDQ703495FDOQ703495
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
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
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- On the definition of a family of automata
- Title not available (Why is that?)
- The equational theory of pomsets
- Series-parallel languages and the bounded-width property
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rationality in algebras with a series operation
- Towards a language theory for infinite N-free pomsets.
- Recognizable formal power series on trees
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Branching automata with costs -- a way of reflecting parallelism in costs
- Title not available (Why is that?)
- Kleene's theorem for weighted tree-automata.
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)
