Sciweavers

33 search results - page 1 / 7
» Semigroup Kernels on Finite Sets
Sort
View
NIPS
2004
13 years 5 months ago
Semigroup Kernels on Finite Sets
Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of posi...
Marco Cuturi, Jean-Philippe Vert
DM
2008
102views more  DM 2008»
13 years 3 months ago
Largest subsemigroups of the full transformation monoid
In this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T S where T has a given property? The semigroups S that w...
R. Gray, J. D. Mitchell
IJAC
2000
70views more  IJAC 2000»
13 years 3 months ago
Finitely Based, Finite Sets of Words
For W a finite set of words, we consider the Rees quotient of a free monoid with respect to the ideal consisting of all words that are not subwords of W. This monoid is denoted by...
Marcel Jackson, Olga Sapir
IJAC
2006
67views more  IJAC 2006»
13 years 3 months ago
Conjugacy Invariants of Subshifts: an Approach from Profinite Semigroup Theory
: It is given a structural conjugacy invariant in the set of pseudowords whose finite factors are factors of a given subshift. Some profinite semigroup tools are developed for this...
Alfredo Costa