Pattern recognition and minimal words in free groups of rank 2

DOI10.1515/jgth.2005.8.4.523zbMath1081.20037OpenAlexW2035105806MaRDI QIDQ5314953

Robert M. Haralick, A. D. Myasnikov, Alexei G. Myasnikov

Publication date: 5 September 2005

Published in: Journal of Group Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jgth.2005.8.4.523

zbMATH Keywords

pattern recognitionprobabilistic algorithmsfree groupsautomorphic orbitsWhitehead methodautomorphism problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Pattern recognition, speech recognition (68T10) Automorphisms of infinite groups (20E36) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Randomized algorithms (68W20)

Related Items

The degree of the special linear characters of a rank two free group.