The following pages link to Semi-commutations (Q1094144):
Displaying 30 items.
- An extended framework for passive asynchronous testing (Q347402) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
- Theory of traces (Q1107296) (← links)
- On lexicographic semi-commutations (Q1108811) (← links)
- 2-asynchronous automata (Q1109571) (← links)
- Semicommutations and algebraic languages (Q1199527) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- Synchronization languages (Q1285575) (← links)
- Atomic semicommutations (Q1314382) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard. (Q1426452) (← links)
- Semi-commutations and Petri nets (Q1822948) (← links)
- Compositionality in dataflow synchronous languages: Specification and distributed code generation (Q1854388) (← links)
- Synchronization languages and rewriting systems (Q1854431) (← links)
- The star problem and the finite power property in trace monoids: Reductions beyond C4 (Q1854540) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Operational semantics with semicommutations (Q2043812) (← links)
- Checking conformance for time-constrained scenario-based specifications (Q2355682) (← links)
- A theory of regular MSC languages (Q2573333) (← links)
- A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols (Q3460215) (← links)
- Characterization of Star-Connected Languages Using Finite Automata (Q3540123) (← links)
- On regular compatibility of semi-commutations (Q4630282) (← links)
- Topological Characterisation of Multi-Buffer Simulation (Q4989168) (← links)
- On the synchronization of semi-traces (Q5055913) (← links)
- Semi-trace morphisms and rational transductions (Q5096739) (← links)
- Modelling concurrency with semi-commutations (Q5096854) (← links)
- Semi-commutations and rational expressions (Q5204311) (← links)
- Reordering Derivatives of Trace Closures of Regular Languages. (Q5875402) (← links)
