Results 201 to 210 of about 20,804 (234)
Some of the next articles are maybe not open access.
ON LANGUAGES FACTORIZING THE FREE MONOID
International Journal of Algebra and Computation, 1996A language X⊂A* is called factorizing if there exists a language Y⊂A* such that XY = A* This work was partially supported by ESPRIT-EBRA project ASMICS contact 6317 and project 40% MURST “Algoritmi, Modelli di Calcolo e Strutture Informative”. and the product is unambiguous.
ANSELMO, Marcella, A. Restivo
openaire +3 more sources
CONJUGACY IN FREE INVERSE MONOIDS
International Journal of Algebra and Computation, 1993We give the equation xz=zy in free inverse monoids the best possible solution by showing, with a technical restriction, that whenever x and y satisfy such an equation for some z, then there exists a finite chain of words, starting in x and ending in y, for which two consecutive words are of the form uv and vu.
openaire +1 more source
Free Profinite ℛ-Trivial Monoids
International Journal of Algebra and Computation, 1997This article is concerned with the structure of semigroups of implicit operations on R, the pseudovariety of all ℛ-trivial semigroups. We give two complementary descriptions for these semigroups: first by means of labeled ordinals, and second by means of labeled infinite trees of finite depth.
J. Almeida, P. Weil
openaire +1 more source
Monoids with Stable Torsion-Free Polygons
Algebra and Logic, 2002Let \(S\) be a monoid with unity \(1\). An \(S\)-polygon is an algebraic system \(_SA=\langle A,s\rangle_{s\in S}\) with the properties \(s_1(s_2a)=(s_1s_2)a\) and \(1a=a\) for all \(s_1,s_2\in S\), \(a\in A\). A polygon is torsion-free if \(sa=sb\Rightarrow a=b\) for all \(a,b\in A\) and all cancellable \(s\in S\).
openaire +2 more sources
Positive theories of free monoids
Algebra and Logic, 1993We denote by \({\mathfrak M}_n\) the free monoid of rank \(n\), and \(a_i\) \((1 \leq i \leq n)\) are its free generators as well as the signature symbols interpreted by these generators. Theorem. Free monoids \({\mathfrak M}_n\) and \({\mathfrak M}_m\) \((2 \leq n < m \leq \omega)\) in the signature \(\langle \cdot, ^{-1}, 1, a_1, \dots, a_k\rangle ...
openaire +2 more sources
2003
We introduce the concept of a fuzzy base of a fuzzy monoid. We also introduce the concepts of a fuzzy code, fuzzy prefix code, and maximal fuzzy prefix code, and examine some of their algebraic properties. The results of Section 8.1–8.9 are essentially from [133].
John N. Mordeson +2 more
openaire +1 more source
We introduce the concept of a fuzzy base of a fuzzy monoid. We also introduce the concepts of a fuzzy code, fuzzy prefix code, and maximal fuzzy prefix code, and examine some of their algebraic properties. The results of Section 8.1–8.9 are essentially from [133].
John N. Mordeson +2 more
openaire +1 more source
Information Sciences, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
Methylammonium-free wide-bandgap metal halide perovskites for tandem photovoltaics
Nature Reviews Materials, 2023Alexandra J Ramadan +2 more
exaly