finite monoids
Recently Published Documents


TOTAL DOCUMENTS

75
(FIVE YEARS 4)

H-INDEX

13
(FIVE YEARS 1)

2021 ◽  
Author(s):  
Yongbing Wang ◽  
Lixia Zhang

Abstract Algrbraic properties and structures of intuitionistic L -fuzzy multiset finite automata (ILFMA) are discussed through congruences on a semigroup in this paper. Firstly,we put forward the notion of the intuitionistic L -fuzzy compatible relation, the compatible monoid associated to the intuitionistic L- fuzzy compatible relation can be effectively constructed, and we construct two finite monoids through two different congruence relations on a given ILFMA, then we also prove that they are isomorphic. Furthermore, using the quotient structure of ILFMA, algebraic properties of intuitionistic L -fuzzy multiset transformation semigroup are discussed. According to intuitionistic L -admissible relation and homomorphism of ILFMA, we show that there is a bijective correspondence between an ILFMA and the quotient structure of another ILFMA.


2020 ◽  
Vol 63 (4) ◽  
pp. 913-928
Author(s):  
Jiří Kaďourek

AbstractIt is shown that, for every prime number p, the complete lattice of all semidirectly closed pseudovarieties of finite monoids whose intersection with the pseudovariety G of all finite groups is equal to the pseudovariety Gp of all finite p-groups has the cardinality of the continuum. Furthermore, it is shown, in addition, that the complete lattice of all semidirectly closed pseudovarieties of finite monoids whose intersection with the pseudovariety G of all finite groups is equal to the pseudovariety Gsol of all finite solvable groups has also the cardinality of the continuum.


2019 ◽  
Vol 27 (5) ◽  
pp. 743-745
Author(s):  
Edmond W H Lee

Abstract It is shown that given any finite system of monoid identities, it is decidable if the class of locally finite monoids that satisfy the system is a variety. This answers an open problem of Mark V. Sapir.


2015 ◽  
Vol 25 (04) ◽  
pp. 567-606 ◽  
Author(s):  
Tullio Ceccherini-Silberstein ◽  
Michel Coornaert

A monoid M is called surjunctive if every injective cellular automata with finite alphabet over M is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all residually finite monoids, all finitely generated linear monoids, and all cancellative one-sided amenable monoids are surjunctive. We also prove that every limit of marked surjunctive monoids is itself surjunctive. On the other hand, we show that the bicyclic monoid and, more generally, all monoids containing a submonoid isomorphic to the bicyclic monoid are non-surjunctive.


Sign in / Sign up

Export Citation Format

Share Document