The following pages link to (Q3736919):
Displaying 50 items.
- Regular languages and partial commutations (Q391641) (← links)
- On a conjecture about finite fixed points of morphisms (Q557920) (← links)
- A remark on the representation of trace monoids (Q584429) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- On the concatenation of infinite traces (Q685439) (← links)
- Möbius functions and confluent semi-commutations (Q685454) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Graphs and free partially commutative monoids (Q803150) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- Non-repetitive words relative to a rewriting system (Q908710) (← links)
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) (Q914365) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- Distribution and synchronized automata (Q917329) (← links)
- On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
- On some equations in free partially commutative monoids (Q1084189) (← links)
- A decision procedure on partially commutative free monoids (Q1086682) (← links)
- Semi-commutations (Q1094144) (← links)
- On regular trace languages (Q1097040) (← links)
- Mixed product and asynchronous automata (Q1099643) (← links)
- Rewriting systems and word problems in a free partially commutative monoid (Q1102124) (← links)
- Theory of traces (Q1107296) (← links)
- The word problem for free partially commutative groups (Q1109139) (← links)
- 2-asynchronous automata (Q1109571) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Théorèmes de transfert pour les polynômes partiellement commutatifs. (Transfer theorems for partially commutative polynomials) (Q1113985) (← links)
- Serialization of concurrent programs (Q1124386) (← 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)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- Two recognizable string-matching problems over free partially commutative monoids (Q1190454) (← links)
- Star-free trace languages (Q1193878) (← links)
- Semicommutations and algebraic languages (Q1199527) (← links)
- The free partially commutative Lie algebra: Bases and ranks (Q1199767) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← 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)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- Recognizable trace languages, distributed automata and the distribution problem (Q1323363) (← links)
- Lyndon traces and shuffle algebras (Q1334807) (← links)
- Deterministic asynchronous automata for infinite traces (Q1338892) (← links)
- A partial trace semantics for Petri nets (Q1341743) (← links)
- The code problem for traces -- improving the boundaries (Q1392032) (← links)
- A cut-invariant law of large numbers for random heaps (Q1692253) (← links)
- The lattices of prefixes and overlaps of traces (Q1815323) (← links)
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables. (Q1854303) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
