On some equations in free partially commutative monoids
Theoretical Computer Science
On the Knuth-Bendix completion for concurrent processes
14th International Colloquium on Automata, languages and programming
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
Security analysis of word problem-based cryptosystems
Designs, Codes and Cryptography
Genetic algorithms for word problems in partially commutative groups
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Compressed conjugacy and the word problem for outer automorphism groups of graph groups
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On properties not inherited by monoids from their Schützenberger groups
Information and Computation
A kolmogorov-type stability measure for evolutionary algorithms
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Partially commutative inverse monoids
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Attacks on public key cryptosystems based on free partially commutative monoids and groups
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
A linear-time algorithm is given for the word problem for free partially commutative groups. The correctness of the algorithm follows from the fact that certain Thue systems, presenting such groups, are preperfect.