See this document in CiteSeerX!

Words guaranteeing minimal image  (Make Corrections)  (1 citation)
S.W. Margolis J.-E. Pin M.V. Volkov



  Home/Search   Context   Related

 
View or download:
liafa.jussieu.fr/~jep/Pos...Kyoto.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  liafa.jussieu.fr/~...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Given a positive integer n and a finite alphabet A, a word w over A is said to guarantee minimal image if, for every homomorphism ' from the free monoid A over A into the monoid of all transformations of an n-element set, the range of the transformation w' has the minimum cardinality among the ranges of all transformations of the form v' where v runs over A . Although the existence of words guaranteeing minimal image is pretty obvious, the problem of their explicit description is very far from... (Update)

Context of citations to this paper:   More

...equivalent to constructing a sequence of words guaranteeing 9 minimum image in each nite full transformation semigroup. We refer to [24] for several explicit constructions of word sequences with the latter property: these constructions are based on an interesting interplay...

Cited by:   More
Profinite Methods in Finite Semigroup Theory - Almeida, Volkov (2001)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Uniform Families and Count Matroids - Pikhurko (1999)   (Correct)
0.3:   Weakly Saturated Hypergraphs and Exterior Algebra - Pikhurko (2000)   (Correct)
0.2:   Piecewise Directable Automata - Petkovic, Steinby (2000)   (Correct)

Similar documents based on text:   More   All
0.1:   Anal., (1999), to appear. [80] L. Robbiano. On the.. - Symbolic Computation..   (Correct)
0.1:   Feature Based Volumetric Video Compression for.. - Sohn, Bajaj.. (2002)   (Correct)
0.1:   Volumetric Video Compression for Real-Time Playback - Sohn, Bajaj, Park, K. (2002)   (Correct)

BibTeX entry:   (Update)

S. Margolis, J.-E. Pin and M. V. Volkov, Words guaranteeing minimal image, submitted. http://citeseer.ist.psu.edu/593505.html   More

@misc{ margolis-words,
  author = "S. Margolis and J. Pin and M. Volkov",
  title = "Words guaranteeing minimal image",
  text = "S. Margolis, J.-E. Pin and M. V. Volkov, Words guaranteeing minimal image,
    submitted.",
  url = "citeseer.ist.psu.edu/593505.html" }
Citations (may not include all citations):
1450   The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
204   Oxford University Press (context) - Crochemore, Rytter et al. - 1994
40   A combinatorial problem (context) - DeBruijn - 1946
11   Reset sequences for monotonic automata - Eppstein - 1990
5   On directable automata (context) - Cern, Pirick et al. - 1971
3   An extremal problem for two families of sets (context) - Frankl - 1982
1   Pro nite methods in nite semigroup theory (context) - Almeida, Volkov - 2001
1   Minimal initializing word: A contribution to (context) - Goehring
1   ennym eksperimentom s konecnymi avtomatami (context) - Cern, Pozn et al. - 1964
1   Les automates circulaires biaises veri ent la conjecture de.. (context) - Dubuc - 1996
1   Berstel and Ph (context) - Beauquier - 1994

Documents on the same site (http://www.liafa.jussieu.fr/~jep/publications.html):   More
Ordered monoids and J-trivial monoids - Henckell, Pin (1999)   (Correct)
Local languages and the Berry-Sethi algorithm - Berstel, Pin (1996)   (Correct)
The Wreath Product Principle for Ordered Semigroups - Pin, Weil (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC