A geometric characterization of automatic 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:
Theoretical Computer Science
Year:
2006

Citing 9
Cited 0

String-rewriting systems

String-rewriting systems
Automatic semigroups

Theoretical Computer Science
Semigroups and Combinatorial Applications

Semigroups and Combinatorial Applications
Word Processing in Groups

Word Processing in Groups
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Extensions and submonoids of automatic monoids

Theoretical Computer Science
Automatic Monoids Versus Monoids with Finite Convergent Presentations

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

Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	5.24

Visualization

Abstract

In the study of automatic groups, the geometrical characterization of automaticity (in terms of the "fellow traveller property") plays a fundamental role. When we move to the study of automatic semigroups, we no longer have this simple formulation. The purpose of this paper is to give a general geometric characterization of automaticity in semigroups.