GROUPS THAT DO AND DO NOT HAVE GROWING CONTEXT-SENSITIVE WORD PROBLEM

From MaRDI portal
Publication:3606404

DOI10.1142/S0218196708004834zbMATH Open1177.20044arXiv0801.4533OpenAlexW2039842064WikidataQ42960065 ScholiaQ42960065MaRDI QIDQ3606404FDOQ3606404


Authors: Derek F. Holt, Sarah Rees, Michael Shapiro Edit this on Wikidata


Publication date: 26 February 2009

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Abstract: We prove that a group has word problem that is a growing context-sensitive language precisely if its word problem can be solved using a non-deterministic Cannon's algorithm (the deterministic algorithms being defined by Goodman and Shapiro). We generalise their results to find many examples of groups not admitting non-deterministic Cannon's algorithms. This adds to the examples of Kambites and Otto of groups separating context-sensitive and growing context-sensitive word problems, and provides a new language-theoretic separation result.


Full work available at URL: https://arxiv.org/abs/0801.4533




Recommendations




Cites Work


Cited In (4)





This page was built for publication: GROUPS THAT DO AND DO NOT HAVE GROWING CONTEXT-SENSITIVE WORD PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606404)