2 research outputs found
Geodesic rewriting systems and pregroups
In this paper we study rewriting systems for groups and monoids, focusing on
situations where finite convergent systems may be difficult to find or do not
exist. We consider systems which have no length increasing rules and are
confluent and then systems in which the length reducing rules lead to
geodesics. Combining these properties we arrive at our main object of study
which we call geodesically perfect rewriting systems. We show that these are
well-behaved and convenient to use, and give several examples of classes of
groups for which they can be constructed from natural presentations. We
describe a Knuth-Bendix completion process to construct such systems, show how
they may be found with the help of Stallings' pregroups and conversely may be
used to construct such pregroups.Comment: 44 pages, to appear in "Combinatorial and Geometric Group Theory,
Dortmund and Carleton Conferences". Series: Trends in Mathematics.
Bogopolski, O.; Bumagin, I.; Kharlampovich, O.; Ventura, E. (Eds.) 2009,
Approx. 350 p., Hardcover. ISBN: 978-3-7643-9910-8 Birkhause
Complexity Results for Confluence Problems
Abstract. We study the complexity of the confluence problem for re-stricted kinds of semi–Thue systems, vector replacement systems and general trace rewriting systems. We prove that confluence for length– reducing semi–Thue systems is P–complete and that this complexity reduces to NC2 in the monadic case. For length–reducing vector re-placement systems we prove that the confluence problem is PSPACE– complete and that the complexity reduces to NP and P for monadic sys-tems and special systems, respectively. Finally we prove that for special trace rewriting systems, confluence can be decided in polynomial time and that the extended word problem for special trace rewriting systems is undecidable.