Automatic Presentations for Cancellative Semigroups

Authors:
Alan J. Cain;Graham Oliver;Nik Ruškuc;Richard M. Thomas
Affiliations:
School of Mathematics and Statistics, University of St Andrews, St Andrews, United Kingdom Fife KY16 9SS;Department of Computer Science, University of Leicester, Leicester, United Kingdom LE1 7RH;School of Mathematics and Statistics, University of St Andrews, St Andrews, United Kingdom Fife KY16 9SS;Department of Computer Science, University of Leicester, Leicester, United Kingdom LE1 7RH
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 7
Cited 0

Automatic semigroups

Theoretical Computer Science
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
Automatic Presentations of Structures

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
On Automatic Partial Orders

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Automatic Structures: Richness and Limitations

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Automatic presentations for finitely generated groups

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies FA-presentable structures and gives a complete classification of the finitely generated FA-presentable cancellative semigroups. We show that a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group.