A. J. Cain > Publications > Articles |
||||
AbstractAn automatic presentation of a relational structure is, informally, a representation of the elements of that structure by means of a regular language such that the relations can all be recognized by finite automata. This paper shows that a finitely generated cancellative semigroup admits an automatic presentation if and only if it is a subsemigroup of a virtually abelian group. |
||||||||
© 1998–2009 A. J. Cain |
|||||