|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc030103,
author = {Juha Kortelainen},
title = {On the System of Word Equations
$x_0u_1^ix_1u_2^ix_2\ldots u_m^ix_m =
y_0v_1^iy_1v_2^iy_2\ldots v_n^iy_n$
$(i = 0,1,2,\ldots)$ in a Free Monoid},
journal = jalc,
year = 1998,
volume = 3,
number = 1,
pages = {43--57},
keywords = {word equation, conjugate, primitive root},
abstract = {We prove that if $x_0,x_1,\dots,x_m,u_1,u_2,\dots,
u_m,y_0,y_1,\dots,y_n,v_1,v_2,\dots,v_n$ are words such that
the equality $x_0u_1^ix_1u_2^ix_2\ldots u_m^ix_m =
y_0v_1^iy_1v_2^iy_2\ldots v_n^ix_n$ holds for
$i = 0,1,2,\ldots, m+n+2$, then it is true for each
$i = 0,1,2,\ldots$}
}