Abstract

Given the presentation for a group of Dehn's algorithm, a multitape Turing machine is shown to exist that solves the word problem for that presentation in linear time. Key to this solution is the pattern matching methodology from complexity theory as well as a recent result for confluent Thue systems.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call