Skip to search formSkip to main contentSkip to account menu

Free monoid

Known as: Periodic morphism, Free hull, Cyclic morphism 
In abstract algebra, the free monoid on a set is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from… 
Wikipedia (opens in a new tab)

Related topics

Related topics

41 relations
Automata theoryAutomatic sequenceCircular shiftCompact semigroup

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Primitive partial permutation representations of the polycyclic monoids and branching function systems
We characterise the maximal proper closed inverse submonoids of the polycyclic inverse monoids, also known as Cuntz inverse… 
2007
2007
Biodiesel Synthesis and Evaluation: An Organic Chemistry Experiment
Recent environmental regulations regarding diesel fuel standards and the role the Midwest may play in future fuel production… 
Highly Cited
2003
Highly Cited
2003
Yield and phytosterol composition of oil extracted from grain sorghum and its wet-milled fractions
ABSTRACT Corn fiber contains an oil with high levels of three potential cholesterol-lowering phytosterol compounds. Little… 
1997
1997
Amalgams of free inverse semigroups
We study inverse semigroup amalgams of the formS *U T whereS andT are free inverse semigroups andU is an arbitrary finitely… 
1995
1995
The Complexity of the Morphism Equivalence Problem for Context-Free Languages
1989
1989
Fairness for non-interleaving concurrency
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to the interleaving approach… 
Review
1985
Review
1985
Words over a Partially Commutative Alphabet
Many interesting combinatorial problems on words deal with rearrangements of words. One of the goals of such rearrangements is to… 
1985
1985
The Ehrenfeucht conjecture: a proof for language theorists
1985
1985
An information-theory analysis of task specialization among worker honey bees performing hive duties
1983
1983
THUE SYSTEMS AND THE CHURCH-ROSSER PROPERTY: REPLACEMENT SYSTEMS, SPECIFICATION OF FORMAL LANGUAGES, AND PRESENTATIONS OF MONOIDS†
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)