Word problems recognisable by deterministic blind monoid automata

Authors:
Mark Kambites
Affiliations:
Fachbereich Mathematik/Informatik, Universität Kassel, Kassel, Germany
Venue:
Theoretical Computer Science
Year:
2006

Citing 4
Cited 1

Extended finite automata over groups

Discrete Applied Mathematics
Automata, Languages, and Machines

Automata, Languages, and Machines
The Accepting Power of Finite Automata over Groups

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
On groups whose word problem is solved by a counter automaton

Theoretical Computer Science

Semigroup automata with rational initial and terminal sets

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.