Pages that link to "Item:Q1566734"

The following pages link to Series-parallel languages and the bounded-width property (Q1566734):

Displaying 35 items.

• Concurrent Kleene algebra with tests and branching automata (Q299205) (← links)
• Series-parallel languages on scattered and countable posets (Q533879) (← links)
• Branching automata with costs -- a way of reflecting parallelism in costs (Q703495) (← links)
• Axiomatizing the identities of binoid languages (Q870834) (← links)
• Regular binoid expressions and regular binoid languages. (Q1401404) (← links)
• Asynchronous cellular automata for pomsets (Q1583242) (← links)
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
• Two equational theories of partial words (Q1643141) (← links)
• On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
• Rationality in algebras with a series operation (Q1854484) (← links)
• Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
• Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids (Q1884948) (← links)
• A categorical framework for learning generalised tree automata (Q2104477) (← links)
• Learning pomset automata (Q2233430) (← links)
• Nested-unit Petri nets (Q2423743) (← links)
• The recognizability of sets of graphs is a robust property (Q2566292) (← links)
• Posets with interfaces as a model for concurrency (Q2672275) (← links)
• Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets (Q2817372) (← links)
• A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES (Q3086249) (← links)
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings (Q3605520) (← links)
• Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
• Algebraic and graph-theoretic properties of infinite<i>n</i>-posets (Q4680742) (← links)
• Complementation of Branching Automata for Scattered and Countable N-Free Posets (Q4683231) (← links)
• Pomset Logic (Q5014600) (← links)
• An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
• Generating Posets Beyond N (Q5098715) (← links)
• (Q5111639) (← links)
• (Q5111642) (← links)
• Multilinear representations of free pros (Q5132617) (← links)
• (Q5155681) (← links)
• Kleene Theorems for Product Systems (Q5200095) (← links)
• Kleene Theorems for Synchronous Products with Matching (Q5268457) (← links)
• (Q5875346) (← links)
• (Q5875403) (← links)
• Logic and rational languages of scattered and countable series-parallel posets (Q5919278) (← links)