scientific article
From MaRDI portal
Publication:3738586
zbMath0602.68070MaRDI QIDQ3738586
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On regular trace languages, Rewriting systems and word problems in a free partially commutative monoid, Overlaps in free partially commutative monoids, Efficient solution of some problems in free partially commutative monoids, Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids, Theory of traces, On lexicographic semi-commutations, On recognizable subsets of free partially commutative monoids, Complete subgraphs of bipartite graphs and applications to trace languages, A new algorithm for compression of partially commutative alphabets, Recognizable closures and submonoids of free partially commutative monoids, Trace monoids with some invertible generators: Two decision problems, Event structures and trace monoids, Two recognizable string-matching problems over free partially commutative monoids, Semicommutations and algebraic languages, String matching problems over free partially commutative monoids, Compositions de fonctions de commutation partielle, On the Knuth-Bendix completion for concurrent processes, On deciding confluence of finite string-rewriting systems modulo partial commutativity, Concurrency measure in commutation monoids, Polynomial algorithm for equivalence problem of deterministic multitape finite automata, Atomic semicommutations, Logical definability on infinite traces
