TY - JOUR
T1 - Pattern recognition and minimal words in free groups of rank 2
AU - Haralick, Robert M.
AU - Miasnikov, Alexei D.
AU - Myasnikov, Alexei G.
PY - 2005/7
Y1 - 2005/7
N2 - We describe a linear time probabilistic algorithm to recognize Whitehead minimal elements (elements of minimal length in their automorphic orbits) in free groups of rank 2. For a non-minimal element the algorithm gives an automorphism that is most likely to reduce the length of the element. This method is based on linear regression and pattern recognition techniques.
AB - We describe a linear time probabilistic algorithm to recognize Whitehead minimal elements (elements of minimal length in their automorphic orbits) in free groups of rank 2. For a non-minimal element the algorithm gives an automorphism that is most likely to reduce the length of the element. This method is based on linear regression and pattern recognition techniques.
UR - http://www.scopus.com/inward/record.url?scp=27944511515&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27944511515&partnerID=8YFLogxK
U2 - 10.1515/jgth.2005.8.4.523
DO - 10.1515/jgth.2005.8.4.523
M3 - Article
AN - SCOPUS:27944511515
SN - 1433-5883
VL - 8
SP - 523
EP - 538
JO - Journal of Group Theory
JF - Journal of Group Theory
IS - 4
ER -