اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAutomaton semigroup constructions
348
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton semigroup. We also show that the class of automaton semigroups is closed under the combined operation of free product followed by adjoining an identity. We present an example of a free product of finite semigroups that we conjecture is not an automaton semigroup. Turning to wreath products, we consider two slight generalizations of the concept of an automaton semigroup, and show that a wreath product of an automaton monoid and a finite monoid arises as a generalized automaton semigroup in both senses. We also suggest a potential counterexample that would show that a wreath product of an automaton monoid and a finite monoid is not a necessarily an automaton monoid in the usual sense.
قيم البحث
اقرأ أيضاً
An improvement on earlier results on free products of automaton semigroups; showing that a free product of two automaton semigroups is again an automaton semigroup providing there exists a homomorphism from one of the base semigroups to the other. Th
e result is extended by induction to give a condition for a free product of finitely many automaton semigroups to be an automaton semigroup.
Tetris is a popular puzzle video game, invented in 1984. We formulate tw
Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets of collidin
g signals. In the present paper, we investigate the use of particles and collisions for constructions involving an infinite number of interacting particles. We obtain a high-level construction for a new smallest intrinsically universal cellular automaton with 4 states.
In this paper we introduce the Schutzenberger category $mathbb D(S)$ of a semigroup $S$. It stands in relation to the Karoubi envelope (or Cauchy completion) of $S$ in the same way that Schutzenberger groups do to maximal subgroups and that the local
divisors of Diekert do to the local monoids $eSe$ of $S$ with $ein E(S)$. In particular, the objects of $mathbb D(S)$ are the elements of $S$, two objects of $mathbb D(S)$ are isomorphic if and only if the corresponding semigroup elements are $mathscr D$-equivalent, the endomorphism monoid at $s$ is the local divisor in the sense of Diekert and the automorphism group at $s$ is the Schutzenberger group of the $mathscr H$-class of $S$. This makes transparent many well-known properties of Greens relations. The paper also establishes a number of technical results about the Karoubi envelope and Schutzenberger category that were used by the authors in a companion paper on syntactic invariants of flow equivalence of symbolic dynamical systems.
The cyclic graph $Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such that whose cy
clic graph $Gamma(S)$ is complete, bipartite, tree, regular and a null graph, respectively. Further, we determine the clique number of $Gamma(S)$ for an arbitrary semigroup $S$. We obtain the independence number of $Gamma(S)$ if $S$ is a finite monogenic semigroup. At the final part of this paper, we give bounds for independence number of $Gamma(S)$ if $S$ is a semigroup of bounded exponent and we also characterize the semigroups attaining the bounds.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
