scientific article; zbMATH DE number 3972221
From MaRDI portal
Publication:3738586
Recommendations
- Square-free words over partially commutative alphabets
- Compression of Words Over a Partially Commutative Alphabet
- scientific article; zbMATH DE number 1737190
- scientific article; zbMATH DE number 512832
- Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
- Algorithmic combinatorics on partial words
- Algorithmic Combinatorics on Partial Words
- Post correspondence problem with partially commutative alphabets
- Words over an ordered alphabet and suffix permutations
- Universal partial words over non-binary alphabets
Cited in
(39)- Some properties of commutation in free partially commutative monoids
- On some equations in free partially commutative monoids
- A decision procedure on partially commutative free monoids
- On regular trace languages
- Rewriting systems and word problems in a free partially commutative monoid
- Theory of traces
- On lexicographic semi-commutations
- On recognizable subsets of free partially commutative monoids
- 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
- On the Knuth-Bendix completion for concurrent processes
- On deciding confluence of finite string-rewriting systems modulo partial commutativity
- Atomic semicommutations
- Concurrency measure in commutation monoids
- Conjugacy on partial words.
- Two optimal parallel algorithms on the commutation class of a word
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
- Words containing a basis for the algebra of all matrices
- Smooth words over arbitrary alphabets
- Overlaps in free partially commutative monoids
- Efficient solution of some problems in free partially commutative monoids
- Commutation in global supermonoid of free monoids
- Compositions de fonctions de commutation partielle
- Complete subgraphs of bipartite graphs and applications to trace languages
- scientific article; zbMATH DE number 3970130 (Why is no real title available?)
- scientific article; zbMATH DE number 4031964 (Why is no real title available?)
- scientific article; zbMATH DE number 1504638 (Why is no real title available?)
- Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
- Logical definability on infinite traces
- The Number of Words of Length n in a Graph Monoid
- Contextual partial commutations
- scientific article; zbMATH DE number 6395612 (Why is no real title available?)
- From monomials to words to graphs.
- A new algorithm for compression of partially commutative alphabets
- Polynomial algorithm for equivalence problem of deterministic multitape finite automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738586)
