Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,712,723 papers from all fields of science
Search
Sign In
Create Free Account
Free monoid
Known as:
Periodic morphism
, Free hull
, Cyclic morphism
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
41 relations
Automata theory
Automatic sequence
Circular shift
Compact semigroup
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Parikh Matrices, Amiability and Istrail Morphism
Adrian Atanasiu
International Journal of Foundations of Computer…
2010
Corpus ID: 8098680
Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of…
Expand
2008
2008
Weighted automata with discounting
M. Droste
,
J. Sakarovitch
,
H. Vogler
Information Processing Letters
2008
Corpus ID: 14295810
2007
2007
Biodiesel Synthesis and Evaluation: An Organic Chemistry Experiment
E. Bucholtz
2007
Corpus ID: 97922877
Recent environmental regulations regarding diesel fuel standards and the role the Midwest may play in future fuel production…
Expand
1999
1999
Tile Transition Systems as Structured Coalgebras
A. Corradini
,
R. Heckel
,
U. Montanari
International Symposium on Fundamentals of…
1999
Corpus ID: 14451749
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and…
Expand
1997
1997
Free Profinite ℛ-Trivial Monoids
J. Almeida
,
P. Weil
International journal of algebra and computation
1997
Corpus ID: 43909299
This article is concerned with the structure of semigroups of implicit operations on R, the pseudovariety of all ℛ-trivial…
Expand
1995
1995
Endoprimal distributive lattices are endodualisable
B. Davey
,
M. Haviar
,
H. Priestley
1995
Corpus ID: 18632269
AbstractL. Márki and R. Pöschel have characterised the endoprimal distributive lattices as those which are not relatively…
Expand
1995
1995
The Complexity of the Morphism Equivalence Problem for Context-Free Languages
Wojciech Plandowski
1995
Corpus ID: 116035259
1993
1993
The Word Problem for the Relatively Free Semigroup Satisfying TM=Tm+n with M≥4 or M=3, n=1
V. Guba
International journal of algebra and computation
1993
Corpus ID: 38912050
Let m≥4, or m=3, n=1. In this article we show that the word problem for the relatively free Burnside semigroup satisfying Tm=Tm+n…
Expand
1985
1985
The Ehrenfeucht conjecture: a proof for language theorists
A. Salomaa
Bull. EATCS
1985
Corpus ID: 41136038
1981
1981
On a Special Monoid with a Single Defining Relation
M. Jantzen
Theoretical Computer Science
1981
Corpus ID: 4764355
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)
ACCEPT & CONTINUE