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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1964-2018
010203019642018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
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… (More)
Is this relevant?
2009
2009
We give an explicit construction of the free monoid in monoidal abelian categories. 
  • figure 1
Is this relevant?
2008
2008
Given positive integers c1, c2, . . . , ck with gcd(c1, c2, . . . , ck) = 1, the Frobenius problem (FP) is to compute the largest… (More)
  • table 1.1
  • figure 1.1
  • table 1.2
  • figure 1.2
  • figure 1.3
Is this relevant?
2004
2004
LetM be a submonoid of the free monoid A∗, and letX ⊂ M be a (variable length) code. X is weakly M -complete iff any word in M is… (More)
  • figure 1
  • figure 2
Is this relevant?
1998
1998
We locate the complexities of evaluating, of inverting, and of testing membership in the image of, morphisms h : Σ∗ → ∆∗. By and… (More)
Is this relevant?
1997
1997
In this paper we prove a conjecture stated in an earlier paper [ A-L]]. The conjecture states that with respect to a rather… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
1996
1996
We prove that the Lambek syntactic calculus allowing empty premises is complete with respect to the class of all free monoid… (More)
Is this relevant?
1986
1986
In general it is undecidable whether or not the monoid described by a given finite presentation is a free monoid or a group… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
  • Imre Simon
  • 19th Annual Symposium on Foundations of Computer…
  • 1978
Since IC::A, A* = I*. Set A is not limited. Indeed, Thue proved that given and integer m~ 1, there exists a word x of lengh m in… (More)
Is this relevant?
1977
1977
families of languages (AFL) have been studied intensively by Ginsburg, Greibach, Harrison, Spanier, and others The families of… (More)
Is this relevant?