Word problems recognisable by deterministic blind monoid automata

Details Word problems recognisable by deterministic blind monoid automata Word problems recognisable by deterministic blind monoid automata

2005-06-08

arxiv.org/abs/math/0506137v2

Mathematics

Group Theory

8 pages, fixed some typos and clarified ambiguity in the abstract, results unchanged

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Word problems recognisable by deterministic blind monoid automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Word problems recognisable by deterministic blind monoid automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Word problems recognisable by deterministic blind monoid automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-538708