From the 1 of 3 linked papers with an AI index.
3 papers
Stallings foldings for rational subsets of automatic groups
LucÃa Asencio-MartÃn, John R. Britnell, Andrew Duncan +2
The paper presents an algorithm to build automata that recognize elements of a given submonoid or rational subset in an automatic group, using a convexity condition called L‑proxim…
Groups with ET0L co-word problem
Raad Al Kohli, Derek F. Holt, Sarah Rees
We study groups whose co-word problems are ET0L languages, which we call coET0L groups, using an automaton based model due to van Leeuwen, and recently studied by Bishop and Elder.…
Rewriting in Artin groups without A_3 or B_3 subdiagrams
Rubén Blasco-GarcÃa, MarÃa Cumplido, Derek F. Holt +2
We prove that the word problem in an Artin group G based on a diagram without A_3 or B_3 subdiagrams can be solved using a system of length preserving rewrite rules which, together…