The main result of this paper establishes invariance under change of generators for automatic structures for monoids (a property that is well known to hold for automatic groups but fails for semigroups). This result is then applied to show that if a free product of two monoids is automatic, then so are both the free factors. Finally the difference between automatic structures, in terms of monoid generating sets and semigroup generating sets, is discussed.</p
To give a general framework for the theory of automatic groups and semigroups, we introduce the noti...
We consider various decision problems for automatic semigroups, which involve the provision of an au...
An automatic presentation for a relational structure is, informally, an abstract representation of t...
The main result of this paper establishes invariance under change of generators for automatic struct...
It is well known that for monoids and completely simple semigroups the property of being automatic d...
AbstractWe consider the automaticity of subsemigroups of free products of semigroups, proving that s...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
The graph product is an operator mixing direct and free products. It is already known that free pro...
The graph product is an operator mixing direct and free products. It is already known that free pro...
We consider various automata-theoretic properties of semigroupoids and small categories and their re...
AbstractWe consider various automata-theoretic properties of semigroupoids and small categories and ...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
AbstractWe consider various automata-theoretic properties of semigroupoids and small categories and ...
AbstractThe area of automatic groups has been one in which significant advances have been made in re...
To give a general framework for the theory of automatic groups and semigroups, we introduce the noti...
We consider various decision problems for automatic semigroups, which involve the provision of an au...
An automatic presentation for a relational structure is, informally, an abstract representation of t...
The main result of this paper establishes invariance under change of generators for automatic struct...
It is well known that for monoids and completely simple semigroups the property of being automatic d...
AbstractWe consider the automaticity of subsemigroups of free products of semigroups, proving that s...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
The graph product is an operator mixing direct and free products. It is already known that free pro...
The graph product is an operator mixing direct and free products. It is already known that free pro...
We consider various automata-theoretic properties of semigroupoids and small categories and their re...
AbstractWe consider various automata-theoretic properties of semigroupoids and small categories and ...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
AbstractWe consider various automata-theoretic properties of semigroupoids and small categories and ...
AbstractThe area of automatic groups has been one in which significant advances have been made in re...
To give a general framework for the theory of automatic groups and semigroups, we introduce the noti...
We consider various decision problems for automatic semigroups, which involve the provision of an au...
An automatic presentation for a relational structure is, informally, an abstract representation of t...