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

DOI10.1142/S0218196708004834zbMath1177.20044arXiv0801.4533OpenAlexW2039842064WikidataQ42960065 ScholiaQ42960065MaRDI QIDQ3606404

Sarah Rees, Michael Shapiro, Derek F. Holt

Publication date: 26 February 2009

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

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

zbMATH Keywords

word problemDehn algorithmgrowing context-sensitive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

The word problem of \(\mathbb{Z}^n\) is a multiple context-free language ⋮ Anisimov's Theorem for inverse semigroups

Cites Work

• ON A GENERALIZATION OF DEHN'S ALGORITHM
• A NOTE ON CONTEXT-SENSITIVE LANGUAGES AND WORD PROBLEMS

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