Results 201 to 210 of about 4,202,174 (239)

Fuzzy Language on Free Monoid

Information Sciences, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jizhong Shen
semanticscholar   +3 more sources

CONJUGACY IN FREE INVERSE MONOIDS

International Journal of Algebra and Computation, 1993
We 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   +3 more sources

THE FREE AMPLE MONOID

International Journal of Algebra and Computation, 2009
We show that the free weakly E-ample monoid on a set X is a full submonoid of the free inverse monoid FIM(X) on X. Consequently, it is ample, and so coincides with both the free weakly ample and the free ample monoid FAM(X) on X. We introduce the notion of a semidirect product Y*T of a monoid T acting doubly on a semilattice Y with identity.
John Fountain, Victoria Gould, Gracinda M. S. Gomes   +2 more
openaire   +2 more sources

States and the free orthogonality monoid

Mathematical Systems Theory, 1972
Let (X, #) be an orthogonality space such that the lattice C(X, #) of closed subsets of (X, #) is orthomodular and let (Γ, ⊥) denote the free orthogonality monoid over (X, #). Let C0(Γ, ⊥) be the subset of C(Γ, ⊥), consisting of all closures of bounded orthogonal sets.
C. H. Randall, David J. Foulis
openaire   +3 more sources

Positive theories of free monoids

Algebra and Logic, 1993
We 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   +3 more sources

A palindromization map on free monoids

Proceedings of the Steklov Institute of Mathematics, 2011
This paper is a survey of several results of combinatorial nature which have been obtained starting from a palindromization map on a free monoid A* introduced by the author in 1997 in the case of a binary alphabet and, successively, generalized by other authors for arbitrary finite alphabets.
openaire   +3 more sources

A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ

Order, 2018
H. Bandelt, M. Pouzet
semanticscholar   +1 more source

Pseudosymmetric equations in a free monoid

, 2014
A. Malkhasyan
semanticscholar   +1 more source

Parametrization of the solutions of the equation x1x2 … xn−1xn = xnxn−1 … x2x2 in a free monoid

, 2011
G. Makanin
semanticscholar   +1 more source

Limited subsets of a free monoid

19th Annual Symposium on Foundations of Computer Science (sfcs 1978), 1978
Imre Simon
semanticscholar   +1 more source