On finitary properties for fiber products of free semigroups and free monoids

We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber product of two free monoids to be finitely generated, and show that all such fiber products are also finitely presented. By way of contrast, we show that fiber products of free semigroups over finite fiber quotients are never finitely generated. We then consider fiber products of free semigroups over infinite semigroups, and show that for such a fiber product to be finitely generated, the quotient must be infinite but finitely generated, idempotent-free, and $$\mathcal {J}$$ J -trivial. Finally, we construct automata accepting the indecomposable elements of the fiber product of two free monoids/semigroups over free monoid/semigroup fibers, and give a necessary and sufficient condition for such a product to be finitely generated.

Neutrosophic Components Semigroups and Multiset Neutrosophic Components Semigroups

Neutrosophic components (NC) under addition and product form different algebraic structures over different intervals. In this paper authors for the first time define the usual product and sum operations on NC. Here four different NC are defined using the four different intervals: (0, 1), [0, 1), (0, 1] and [0, 1]. In the neutrosophic components we assume the truth value or the false value or the indeterminate value to be from the intervals (0, 1) or [0, 1) or (0, 1] or [0, 1]. All the operations defined on these neutrosophic components on the four intervals are symmetric. In all the four cases the NC collection happens to be a semigroup under product. All of them are torsion free semigroups or weakly torsion free semigroups. The NC defined on the interval [0, 1) happens to be a group under addition modulo 1. Further it is proved the NC defined on the interval [0, 1) is an infinite commutative ring under addition modulo 1 and usual product with infinite number of zero divisors and the ring has no unit element. We define multiset NC semigroup using the four intervals. Finally, we define n-multiplicity multiset NC semigroup for finite n and these two structures are semigroups under + modulo 1 and { M ( S ) , + , × } and { n - M ( S ) , + , × } are NC multiset semirings. Several interesting properties are discussed about these structures.

Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes

This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell’s aperiodic pointlike theorem. We use a new algebraic technique that we call the merge decomposition. A prototypical application of this technique decomposes a semigroup $T$ into a two-sided semidirect product whose components are built from two subsemigroups $T_{1}$, $T_{2}$, which together generate $T$, and the subsemigroup generated by their setwise product $T_{1}T_{2}$. In this sense we decompose $T$ by merging the subsemigroups $T_{1}$ and $T_{2}$. More generally, our technique merges semigroup homomorphisms from free semigroups.

The complexity of weakly recognizing morphisms

Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of ω-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is accepted by some Büchi automaton. We study the descriptional complexity of various constructions and the computational complexity of various decision problems for weakly recognizing morphisms. The constructions we consider are the conversion from and to Büchi automata, the conversion into strongly recognizing morphisms, as well as complementation. We also show that the fixed membership problem is NC1-complete, the general membership problem is in L and that the inclusion, equivalence and universality problems are NL-complete. The emptiness problem is shown to be NL-complete if the input is given as a non-surjective morphism.

FREE SEMIGROUP PRESENTATIONS

Let and be two free semigroups. We define external direct product of two free semigroups as an ordered pair of words such that and .We investigate the presentations of external direct product of free semigroups, state and prove under some conditions that the external direct product of two finitely generated free semigroups is finitely generated, also the external direct product of two finitely presented free semigroups is finitely presented.