3818 search results - page 1 / 764 » Word Problems on Compressed Words |
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
DLT
2010
13 years 7 months ago
2010
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
IJAC
2010
13 years 4 months ago
2010
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
CSR
2009
Springer
14 years 4 days ago
2009
Springer
STRINGOLOGY
2008
13 years 7 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...