When is a functionally free algebra free?
T. Evans (1972)
Semigroup forum
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The intersection of free submonoids of a free monoid is free.”
When is a functionally free algebra free?
A note on intersections of free submonoids of a free monoid.
J. Karhumäki (1984)
Semigroup forum
Similarity:
Some Free Submonoids of the Free Monoid of Prefix Codes.
H.J. SHYR (1975)
Semigroup forum
Similarity:
Note on compatible well orders on a free monoid.
Y. Kobayashi (1992)
Semigroup forum
Similarity:
A note on homomorphisms of a free monoid.
C.M. Reis (1978)
Semigroup forum
Similarity:
Square-free and overlap-free words
A. J. Kfoury (1988)
Banach Center Publications
Similarity:
The nucleus of the free alternative algebra.
Hentzel, I.R., Peresi, L.A. (2006)
Experimental Mathematics
Similarity:
Fixed-point free maps of Euclidean spaces
R. Z. Buzyakova, A. Chigogidze (2011)
Fundamenta Mathematicae
Similarity:
Our main result states that every fixed-point free continuous self-map of ℝⁿ is colorable. This result can be reformulated as follows: A continuous map f: ℝⁿ → ℝⁿ is fixed-point free iff f̃: βℝⁿ → βℝⁿ is fixed-point free. We also obtain a generalization of this fact and present some examples
A theorem on free envelopes.
Chester, jr. John (1974)
Semigroup forum
Similarity:
Homomorphisms of free contents.
J. Shafer (1974)
Semigroup forum
Similarity:
Free inverse semigroups
Mario Petrich (1990)
Colloquium Mathematicae
Similarity:
Fixed points of endomorphisms of certain free products
Pedro V. Silva (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.
Fixed points of endomorphisms of certain free products
Pedro V. Silva (2012)
RAIRO - Theoretical Informatics and Applications
Similarity:
The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.