On graph products of automatic monoids

@article{Costa2001OnGP,
  title={On graph products of automatic monoids},
  author={A. Veloso da Costa},
  journal={RAIRO Theor. Informatics Appl.},
  year={2001},
  volume={35},
  pages={403-417}
}
  • A. V. D. Costa
  • Published 1 September 2001
  • Mathematics
  • RAIRO Theor. Informatics Appl.
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established. 
On Graph Products of Automatic and Biautomatic Monoids
It is shown that the graph product of automatic monoids is always automatic thereby improving on a result by Veloso da Costa [22] who showed this result provided the factors have finite geometric
Word Equations over Graph Products
TLDR
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products and the positive theory of a graph product of groups can be reduced to the positive theories of those factors.
GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS
Abstract Our first main result shows that a graph product of right cancellative monoids is itself right cancellative. If each of the component monoids satisfies the condition that the intersection of
Finite Derivation Type for Graph Products of Monoids
The aim of this paper is to show that the class of monoids of finite derivation type is closed under graph products.
Graph products of left abundant monoids
Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then
R A ] 1 2 Fe b 20 21 GRAPH PRODUCTS OF LEFT ABUNDANT MONOIDS
Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then
Logical Aspects of Cayley-graphs: the Monoid Case
TLDR
It is shown that the decidability of the first-order theory of a structure is preserved by factorized unfoldings, and the class of monoids, for which the Cayley-graph has a decidable first- order theory, is closed under free products.
The homomorphism problem for trace monoids

References

SHOWING 1-10 OF 10 REFERENCES
Graph products of monoids
The main aim of this paper is to characterize the Green relations in the graph product of monoids. Necessary and sufficient conditions for an element in a graph product of monoids to be idempotent,
Automatic monoids and change of generators
TLDR
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) and shows that if a free product of two monoids is automatic, then so are both the free factors.
Algorithms and Geometry for Graph Products of Groups
Recent work of Gromov, Epstein, Cannon, Thurston and many others has generated strong interest in the geometric and algorithmic structure of finitely generated infinite groups. (See [16],[17] and
Graph products of groups
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems,
Automatic semigroups
Automatic Completely-Simple Semigroups
AbstractThe notion of automaticity has been widely studied in groups and some progress has been made in understanding the notion in the wider context of semigroups. The purpose of this paper is to
INTRODUCTION TO SEMIGROUP THEORY
Any short book on semigroup theory would inevitably be shallow were its scope not limited to certain parts of the theory. This volume concentrates primarily on regular semigroups, for which a well
Introduction to Automata Theory, Languages and Computation
Products of groups
1. ELEMENTARY PROPERTIES OF FACTORIZED GROUPS 2. PRODUCTS OF NILPOTENT GROUPS 3. PRODUCTS OF PERIODIC GROUPS 4. PRODUCTS OF GROUPS OF FINITE RANK 5. SPLITTING AND CONJUGACY THEOREMS 6. TRIPLY