Word problems recognisable by deterministic blind monoid automata
| dc.creator | Kambites, Mark | |
| dc.date | 2005-06-08 | |
| dc.date | 2005-07-27 | |
| dc.date.accessioned | 2026-07-07T05:20:36Z | |
| dc.date.available | 2026-07-07T05:20:36Z | |
| dc.description | 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. | |
| dc.description | 8 pages, fixed some typos and clarified ambiguity in the abstract, results unchanged | |
| dc.identifier | https://arxiv.org/abs/math/0506137 | |
| dc.identifier | http://arxiv.org/abs/math/0506137 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/75431 | |
| dc.subject | Group Theory | |
| dc.subject | 20F10 (Primary); 20M05 (Secondary) | |
| dc.title | Word problems recognisable by deterministic blind monoid automata | |
| dc.type | text |