Series-parallel languages and the bounded-width property

From MaRDI portal
Publication:1566734

DOI10.1016/S0304-3975(00)00031-1zbMath0939.68042OpenAlexW2045594629MaRDI QIDQ1566734

Pascal Weil, Kamal Lodaya

Publication date: 4 June 2000

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00031-1




Related Items (36)

Towards a language theory for infinite N-free pomsets.Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoidsConcurrent Kleene algebra with tests and branching automataAn Analytic Propositional Proof System on GraphsTwo equational theories of partial wordsAxiomatizing the identities of binoid languagesPosets with interfaces as a model for concurrencyGenerating Posets Beyond NNested-unit Petri netsRegular binoid expressions and regular binoid languages.Concurrent NetKAT. Modeling and analyzing stateful, concurrent networksUnnamed ItemUnnamed ItemMultilinear representations of free prosOn series-parallel pomset languages: rationality, context-freeness and automataLearning pomset automataSeries-parallel languages on scattered and countable posetsBranching automata with costs -- a way of reflecting parallelism in costsAlgebraic and graph-theoretic properties of infiniten-posetsComplementation of Branching Automata for Scattered and Countable N-Free PosetsLogic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear OrderingsKleene Theorems for Product SystemsUnnamed ItemUnnamed ItemLogic and rational languages of scattered and countable series-parallel posetsA KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGESComplementation of Branching Automata for Scattered and Countable Series-Parallel PosetsPomset Languages of Finite Step Transition SystemsThe recognizability of sets of graphs is a robust propertyAsynchronous cellular automata for pomsetsUnnamed ItemRationality in algebras with a series operationPomset LogicA categorical framework for learning generalised tree automataKleene Theorems for Synchronous Products with MatchingAxiomatizing the subsumption and subword preorders on finite and infinite partial words



Cites Work




This page was built for publication: Series-parallel languages and the bounded-width property