A Kleene iteration for parallelism

DOI10.1007/978-3-540-49382-2_33MaRDI QIDQ4247275zbMATH OpenFDO

Authors Kamal Lodaya, Pascal Weil

Publication date 16 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-49382-2_33

zbMATH Keywords

branching automatonPetri nets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Series-parallel posets: Algebra, automata and languages
• Series-parallel languages and the bounded-width property
• Series-Parallel Languages on Scattered and Countable Posets
• Branching automata with costs -- a way of reflecting parallelism in costs
• Branching automata with costs -- a way of reflecting parallelism in costs

Cited in

(15)

• Series-parallel languages and the bounded-width property
• Asynchronous cellular automata for pomsets
• Rationality in algebras with a series operation
• Learning pomset automata
• Quotients of unbounded parallelism
• Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
• Branching automata with costs -- a way of reflecting parallelism in costs
• scientific article; zbMATH DE number 3907755 (Why is no real title available?)
• Series-parallel posets: Algebra, automata and languages
• Algebraic and graph-theoretic properties of infiniten-posets
• Complementation of Branching Automata for Scattered and Countable N-Free Posets
• Multilinear representations of free pros
• Higher-dimensional automata: extension to infinite tracks
• Active learning techniques for pomset recognizers
• Axiomatizing the identities of binoid languages

This page was built for publication: A Kleene iteration for parallelism

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