Solvability Of Equations In Graph Groups Is Decidable
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION(2006)
摘要
We show that the existential theory of free partially commutative monoids with involution is decidable. As a consequence the existential theory of graph groups is also decidable. If the underlying alphabet of generators is fixed, we obtain a PSPACE-completeness result, otherwise (in the uniform setting) our decision procedure is in EXPSPACE. Our proof is a reduction to the main result of [6].
更多查看译文
关键词
equations, graph groups, free partially commutative monoids
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要