Results 1 to 10 of about 205 (176)

On transformation semigroups which are ℬ𝒬-semigroups [PDF]

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2006
A semigroup whose bi-ideals and quasi-ideals coincide is called a ℬ𝒬-semigroup. The full transformation semigroup on a set X and the semigroup of all linear transformations of a vector space V over a field F into itself are denoted, respectively, by T(X)
S. Nenthein, Y. Kemprasit
doaj   +2 more sources

Structural properties and isomorphism theorems for Cayley digraphs of full transformation semigroups with respect to Green's equivalence classes [PDF]

open access: yesHeliyon, 2023
Let T(X) be the full transformation semigroup on a nonempty set X. In this paper, the Cayley digraphs of T(X) with connection sets L and R, the Green's equivalence classes of T(X) according to the Green's relations L and R, are investigated. Furthermore,
Nuttawoot Nupo, Yanisa Chaiya
doaj   +2 more sources

Structure of the (Total) Transformation Monoids Under Rank N Generators [version 2; peer review: 2 approved] [PDF]

open access: yesF1000Research
Throughout this paper our study focuses on transformation semigroups. These kinds of semigroups are the corner stone of semigroup theory. This is because every semigroup is isomorphic to transformation semigroup.
Asawer Al-Aadhami, Hala M. Sulaiman
doaj   +2 more sources

Left (Right) Regular Elements of Some Transformation Semigroups

open access: yesMathematics, 2023
For a nonempty set X, let T(X) be the total transformation semigroup on X. In this paper, we consider the subsemigroups of T(X) which are defined by T(X,Y) ={α∈T(X):Xα⊆Y}andS(X,Y)={α∈T(X):Yα⊆Y} where Y is a non-empty subset of X. We characterize the left
Kitsanachai Sripon   +2 more
doaj   +3 more sources

On Magnifying Elements in E-Preserving Partial Transformation Semigroups

open access: yesMathematics, 2018
Let S be a semigroup. An element a of S is called a right [left] magnifying element if there exists a proper subset M of S satisfying S = M a [ S = a M ] . Let E be an equivalence relation on a nonempty set X.
Thananya Kaewnoi   +2 more
doaj   +3 more sources

Semigroup-theoretic analysis of supply-chain disruptions and resilience. [PDF]

open access: yesPLoS ONE
This paper develops a rigorous framework using finite transformation semigroups to model supply-chain state evolution under cascading disruptions and resilience interventions.
Job Agba Opue   +3 more
doaj   +2 more sources

On the Syntactic Monoids Associated with a Class of Synchronized Codes [PDF]

open access: yesThe Scientific World Journal, 2013
A complete code C over an alphabet A is called synchronized if there exist x,y∈C* such that xA*∩A*y⊆C*. In this paper we describe the syntactic monoid Syn(C+) of C+ for a complete synchronized code C over A such that C+, the semigroup generated by C, is ...
Shou-feng Wang
doaj   +2 more sources

ISOMORPHISM PROBLEMS FOR TRANSFORMATION SEMIGROUPS

open access: yesSemigroups and Formal Languages, 2007
Many people have studied the problem of describing all isomorphisms between transformation semigroups dened on sets and between linear transformation semigroups dened on vector spaces. In this paper, we summarise some of that work, as well as recent work showing that Baer-Levi semigroups dened on sets are never isomorphic to their linear analogue ...
Suzana Mendes-Gonçalves
exaly   +3 more sources

TRANSFORMATION SEMIGROUPS AND TRANSFORMED DIMENSIONS [PDF]

open access: yesJournal of Sciences, Islamic Republic of Iran, 2001
In the transformation semigroup (X, S) we introduce the height of a closed nonempty invariant subset of X, define the transformed dimension of nonempty subset S of X and obtain some results and relations.
doaj   +1 more source

Elementary definability of the class of universal hypergraphic automata in the class of semigroups [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022
Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal
Molchanov, Vladimir Aleksandrovich   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy