The following pages link to Combinatorics on traces (Q1188891):
Displaying 50 items.
- Topological abstraction of higher-dimensional automata (Q278749) (← links)
- Fixed points of endomorphisms of trace monoids. (Q467531) (← links)
- Uniform and Bernoulli measures on the boundary of trace monoids (Q491977) (← links)
- The global dimension of a trace monoid ring (Q535217) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- On the concatenation of infinite traces (Q685439) (← links)
- Möbius functions and confluent semi-commutations (Q685454) (← links)
- The poset of infinitary traces (Q689293) (← links)
- Contraction of Dirac matrices via chord diagrams (Q826437) (← links)
- Infinite traces and symbolic dynamics (Q841627) (← links)
- On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Weighted asynchronous cellular automata (Q1022595) (← links)
- Star-free trace languages (Q1193878) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- The shuffle algebra and its derivations (Q1261473) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Parallelization of automata (Q1288662) (← links)
- Elements of a theory of computer simulation. I (Q1294327) (← links)
- Determinants and Möbius functions in trace monoids (Q1297486) (← 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)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← 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)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- On the complementation of asynchronous cellular Büchi automata (Q1349891) (← links)
- On projective and separable properties (Q1389766) (← links)
- The code problem for traces -- improving the boundaries (Q1392032) (← links)
- Resource traces: A domain for processes sharing exclusive resources. (Q1605180) (← links)
- Toward uniform random generation in 1-safe Petri nets (Q1687776) (← links)
- A cut-invariant law of large numbers for random heaps (Q1692253) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- A Hopf algebra for counting cycles (Q1709547) (← links)
- Möbius inversion formula for the trace group (Q1764102) (← 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)
- Two optimal parallel algorithms on the commutation class of a word (Q1882917) (← links)
- Regular sets of infinite message sequence charts (Q1887140) (← links)
- Lexicographically first reduced words (Q1910510) (← links)
- The Tutte-Grothendieck group of an alphabetic rewriting system (Q1952720) (← links)
- Synchronization of Bernoulli sequences on shared letters (Q2013553) (← links)
- A spectral property for concurrent systems and some probabilistic applications (Q2032884) (← links)
- Deterministic concurrent systems (Q2117189) (← links)
- Markovian dynamics of concurrent systems (Q2177775) (← links)
