Biautomatic semigroups

Authors:
Michael Hoffmann;Richard M. Thomas
Affiliations:
Department of Computer Science, University of Leicester, Leicester, UK;Department of Computer Science, University of Leicester, Leicester, UK
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 4
Cited 2

Automatic semigroups

Theoretical Computer Science
Semigroups and Combinatorial Applications

Semigroups and Combinatorial Applications
Word Processing in Groups

Word Processing in Groups
Automatic Monoids Versus Monoids with Finite Convergent Presentations

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications

Notions of hyperbolicity in monoids

Theoretical Computer Science
Notions of hyperbolicity in monoids

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider biautomatic semigroups. There are two different definitions of a biautomatic structure for a group in the literature; whilst these definitions are not equivalent, the idea of a biautomatic group is well defined, in that a group possesses one type of biautomatic structure if and only if it possesses the other. However the two definitions give rise to different notions of biautomaticity for semigroups and we study these ideas in this paper. In particular, we settle the question as to whether automaticity and biautomaticity are equivalent for semigroups by giving examples of semigroups which are automatic but not biautomatic.