Pages that link to "Item:Q1874399"
From MaRDI portal
The following pages link to Towards a language theory for infinite N-free pomsets. (Q1874399):
Displaying 11 items.
- 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)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets (Q2817372) (← 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)
- Equational Theories of Scattered and Countable Series-Parallel Posets (Q5041243) (← links)
- Logic and rational languages of scattered and countable series-parallel posets (Q5919278) (← links)
