AbstractIn this paper, submonoids and extensions of automatic and p-automatic monoids are studied. The concept of a p-automatic monoid is a variant on the usual concept of an automatic monoid designed to allow a geometric characterization analogous to the group case. In the case of right cancellative monoids, the two concepts coincide. Here, we study rational submonoids of (p-)automatic monoids, being able to show in many cases that (p-)automaticity is inherited. Our sharpest results concern rational subgroups. Also, closure properties are established for various notions of extensions of (p-)automatic monoids, including different types of products, ideal extensions, and Rees matrix constructions
The main result of this paper establishes invariance under change of generators for automatic struct...
Abstract. We prove several complexity and decidability results for automatic monoids: (i) there exis...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
AbstractIn this paper, submonoids and extensions of automatic and p-automatic monoids are studied. T...
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 ...
AbstractWe show that any finite monoid or semigroup presentation satisfying the small overlap condit...
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...
AbstractIn our first part of this paper we defined and studied the family of rational monoids, which...
Abstract The history, denition and principal properties of automatic groups and their generalisation...
AbstractWe consider various automata-theoretic properties of semigroupoids and small categories and ...
The main result of this paper establishes invariance under change of generators for automatic struct...
The main result of this paper establishes invariance under change of generators for automatic struct...
Abstract. We prove several complexity and decidability results for automatic monoids: (i) there exis...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
AbstractIn this paper, submonoids and extensions of automatic and p-automatic monoids are studied. T...
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 ...
AbstractWe show that any finite monoid or semigroup presentation satisfying the small overlap condit...
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...
AbstractIn our first part of this paper we defined and studied the family of rational monoids, which...
Abstract The history, denition and principal properties of automatic groups and their generalisation...
AbstractWe consider various automata-theoretic properties of semigroupoids and small categories and ...
The main result of this paper establishes invariance under change of generators for automatic struct...
The main result of this paper establishes invariance under change of generators for automatic struct...
Abstract. We prove several complexity and decidability results for automatic monoids: (i) there exis...
We develop an effective and natural approach to interpret any semigroup admitting a special language...