You are here: MIMS > EPrints
MIMS EPrints

2007.30: Word problems recognisable by deterministic blind monoid automata

2007.30: Mark Kambites (2006) Word problems recognisable by deterministic blind monoid automata. Theoretical Computer Science, 362 (1-3). pp. 232-237. ISSN 0304-3975

Full text available as:

PDF - Archive staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
168 Kb

DOI: 10.1016/j.tcs.2006.06.026


We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class including groups, such an automaton accepts the word problem of a group H if and only if H has a finite index subgroup which embeds in the group of units of M. In the case that M is a group, this answers a question of Elston and Ostheimer.

Item Type:Article
Uncontrolled Keywords:Group; Monoid; Automaton; Word problem; Finite index subgroup
Subjects:MSC 2000 > 18 Category theory; homological algebra
MIMS number:2007.30
Deposited By:Miss Louise Stait
Deposited On:27 March 2007

Download Statistics: last 4 weeks
Repository Staff Only: edit this item