The following pages link to (Q3947146):
Displaying 21 items.
- Partial commutations and faithful rational transductions (Q799383) (← links)
- On regular trace languages (Q1097040) (← links)
- On the decidability of some problems about rational subsets of free partially commutative monoids (Q1099641) (← links)
- Theory of traces (Q1107296) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
- On the decidability of the equivalence problem for partially commutative rational power series (Q1193904) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- The code problem for traces -- improving the boundaries (Q1392032) (← links)
- The lattices of prefixes and overlaps of traces (Q1815323) (← links)
- Membership problems for regular and context-free trace languages (Q1824384) (← links)
- Number of prefixes in trace monoids: clique polynomials and dependency graphs (Q2106610) (← links)
- Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
- Compositions de fonctions de commutation partielle (Q3031949) (← links)
- Complete subgraphs of bipartite graphs and applications to trace languages (Q3479529) (← links)
- Trace languages defined by regular string languages (Q3753510) (← links)
- Characterizations of the decidability of some problems for regular trace languages (Q4729376) (← links)
- Probabilistic asynchronous automata (Q4864443) (← links)
- On the structure of recognizable languages of dependence graphs (Q5286052) (← links)
- From non-preemptive to preemptive scheduling using synchronization synthesis (Q5892421) (← links)
- Preface (Q5898759) (← links)
