The following pages link to (Q3738586):
Displaying 23 items.
- Polynomial algorithm for equivalence problem of deterministic multitape finite automata (Q784484) (← links)
- On regular trace languages (Q1097040) (← links)
- Rewriting systems and word problems in a free partially commutative monoid (Q1102124) (← links)
- Theory of traces (Q1107296) (← links)
- On lexicographic semi-commutations (Q1108811) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
- Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
- Event structures and trace monoids (Q1183599) (← links)
- Two recognizable string-matching problems over free partially commutative monoids (Q1190454) (← links)
- Semicommutations and algebraic languages (Q1199527) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- On the Knuth-Bendix completion for concurrent processes (Q1262753) (← links)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
- Atomic semicommutations (Q1314382) (← links)
- Concurrency measure in commutation monoids (Q1824702) (← links)
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids (Q1901039) (← links)
- Overlaps in free partially commutative monoids (Q2639969) (← 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)
- Logical definability on infinite traces (Q4630272) (← links)
- A new algorithm for compression of partially commutative alphabets (Q6122306) (← links)
