See this document in CiteSeerX!

Periodicity and Repetition in Combinatorics on Words (2004)  (Make Corrections)  
Ming-wei Wang



  Home/Search   Context   Related

 
View or download:
etd.uwaterloo.ca/etd/m2wang2004.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  etd.uwaterloo.ca/etd/ (more)
(Enter author homepages)

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

Abstract: This thesis concerns combinatorics on words. I present many results in this area, united by the common themes of periodicity and repetition. Most of these results have already appeared in journal or conference articles. Chapter 2 -- Chapter 5 contain the most significant contribution of this thesis in the area of combinatorics on words. Below we give a brief synopsis of each chapter. Chapter 1 introduces the subject area in general and some background information. Chapter 2 and Chapter 3 grew... (Update)

Active bibliography (related documents):   More   All
3.5:   On Two-Sided Infinite Fixed Points of Morphisms - Jeffrey Shallit, Ming-wei Wang (1999)   (Correct)
3.0:   Automatic Complexity of Strings - Shallit, Wang (2001)   (Correct)
2.4:   Infinite Sequences and Pattern Avoidance - Rampersad (2004)   (Correct)

BibTeX entry:   (Update)

@misc{ wang-periodicity,
  author = "Ming-wei Wang",
  title = "Periodicity and Repetition in Combinatorics on Words",
  url = "citeseer.ist.psu.edu/wang04periodicity.html" }
Citations (may not include all citations):
1911   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
660   An Introduction to Kolmogorov Complexity and Its Application.. - Li, Vitanyi - 1997
220   Formal Languages (context) - Salomaa - 1973
204   Oxford University Press (context) - Crochemore, Rytter - 1994
151   An Introduction to Symbolic Dynamics and Coding (context) - Lind, Marcus - 1995
116   Algorithmic Number Theory (context) - Bach, Shallit - 1996
58   Algebraic Combinatorics on Words (context) - Lothaire - 2002
43   Uniqueness theorems for periodic functions (context) - Fine, Wilf - 1965
42   Uber unendliche zeichenreihen (context) - Thue - 1906
37   Uber die gegenseitige Lage gleicher Teile gewisser Zeichenre.. (context) - Thue - 1977
36   Avoidable patterns in strings of symbols (context) - Bean, Ehrenfeucht et al. - 1979
29   Automaticity I: Properties of a measure of descriptional com.. (context) - Shallit, Breitbart - 1996
27   Sturmian words (context) - Berstel - 2002
24   volume 17 of Encyclopedia of Mathematics and Its Application.. (context) - Lothaire, Words - 1983
24   Combinatorics of words (context) - Cho, Karhumaki - 1997
21   Non-repetitive sequences (context) - Pleasants - 1970
20   Recurrent geodesics on a surface of negative curvature (context) - Morse - 1921
19   Open problems in pattern avoidance (context) - Currie - 1993
17   Automates finis en theorie des nombres (context) - Allouche - 1987
14   Axel Thue's Papers on Repetitions in Words: a Translation (context) - Berstel - 1995
14   Infinite periodic groups (context) - Novikov, Adian - 1968
13   The ubiquitous Prouhet-Thue-Morse sequence - Allouche, Shallit - 1999
12   some combinatorial properties of Sturmian words (context) - de Luca, Mignosi - 1994
10   symbolic dynamics and a problem in semigroups (context) - Morse, Hedlund - 1944
10   Fine and Wilf's theorem for three periods and a generalizati.. (context) - Castelli, Mignosi et al. - 2003
10   Unavoidable binary patterns - Cassaigne - 1993
9   A problem on strings of beads (context) - Leech - 1957
9   th power-free homomorphisms (context) - Brandenburg, k- - 1983
9   nicht negative Matrizen (context) - Wielandt - 1950
8   Ensembles reconnaissables de mots biinfinis (context) - Nivat, Perrin - 1986
8   On nonrepetitive sequences (context) - Entringer, Jackson et al. - 1974
8   Problems and Theorems in Analysis II (context) - Polya, Szego - 1976
8   Ensembles reconnaissables de mots biinfinis (context) - Nivat, Perrin - 1982
8   Automatic Sequences: Theory (context) - Allouche, Shallit - 2003
7   Memoire sur quelques relations entres les puissances des nom.. (context) - Prouhet
6   On sequences which contain no repetitions (context) - Hawkins, Mientka - 1956
6   a paper by Castelli (context) - Justin - 2000
6   Wiederholungsfreie Folgen (context) - Zech - 1958
5   Combinatorics on words -- a tutorial - Berstel, Karhumaki - 2003
5   Uber die Maximalordnung der Permutationen gegebenen Grades (context) - Landau - 1903
5   Recursive cellular automata invariant sets (context) - Hurd - 1990
4   Characterization of finite and one-sided infinite fixed poin.. (context) - Hamm, Shallit - 1999
4   Dejean sur les repetitions dans les mots (context) - Pansiot, d'une et al. - 1984
4   Enormous integers in real life (context) - Friedman - 2000
4   Is there a sequence on four symbols in which no two adjacent.. (context) - Brown - 1971
4   volume 95 of Ergebnisse der Mathematik und ihrer Grenzgebiet.. (context) - Adian, problem et al. - 1979
4   Polynomial versus exponential growth in repetitionfree binar.. (context) - Karhumaki, Shallit - 2003
3   Bi-infinitary codes (context) - Van and, Thomas et al. - 1990
3   Ensembles reconnaissables de mots bi-infinis (context) - Beaquier - 1985
3   volume 141 of Pure and Applied Mathematics (context) - Perrin, Pin et al. - 2004
3   Partial words and a theorem of Fine and Wilf - Berstel, Boasson - 1999
3   the Hartmanis-Stearns problem for a class of tag machines (context) - Cobham - 1968
3   Complete prime subsets of consecutive integers (context) - Erdos, Selfridge - 1971
3   the length of word chains (context) - Berstel, Brlek - 1987
3   Linear Algebra and Its Applications (context) - Shallit, Wang et al. - 1999
3   and an arithmetic self-similar set (context) - Allouche, bases et al. - 2001
3   Fixed languages and the adult languages of 0L schemes (context) - Head - 1981
3   On discerning words by automata (context) - Goralck, Koubek - 1986
3   Gaps in the exponent set of primitive matrices (context) - Dulmage, Mendelsohn - 1964
3   Finitary codes for biinfinite words (context) - Devolder, Timmerman - 1992
3   The maximum order of an element of a finite symmetric group (context) - Miller - 1987
2   Avoiding large squares in infinite binary words (context) - Rampersad, Shallit et al. - 2003
2   Optimal word chains for the Thue-Morse word (context) - Arnold, Brlek - 1989
2   Separating words with machines and groups (context) - Robson - 1996
2   Long finite sequences - Friedman - 2001
2   On repetitions of blocks in binary sequences (context) - Dekking - 1976
2   Sequences generated by infinitely iterated morphisms (context) - Seebold - 1985
2   Multi-dimensional versions of a theorem of Fine and Wilf and.. - Simpson, Tijdeman - 2003
2   The Tarry-Escott problem (context) - Lehmer - 1947
2   Separating strings with small automata (context) - Robson - 1989
2   Sur la construction de mots sans carre (context) - Berstel - 1979
2   Automatic complexity of strings - Shallit, Wang - 2001
2   A new combinatorial complexity measure for languages (context) - Diwan - 1986
2   Magic cubes and Prouhet sequences (context) - Alder, Li - 1977
2   A formula related to the Frobenius problem in two dimensions - Beck, Robins - 2000
2   the graphs and asymptotic forms of finite Boolean relation m.. (context) - Rosenblatt - 1957
2   On powers of non-negative matrices (context) - Holladay, Varga - 1958
2   An improved lower bound on the greatest element of a sum-dis.. (context) - Elkies - 1986
1   Fine and Wilf words for any periods - Tijdeman, Zamboni - 2003
1   Tight lower bounds for the length of word chains (context) - Althofer - 1990
1   Subword complexity and a matrix inequality (context) - Wang - 1999
1   the irregularity of the duplication closure (context) - Wang - 2000
1   Sur les polynomes harmoniques quelconques (context) - Fejer - 1913
1   Arithmetic properties of periodic maps (context) - Sun - 2004
1   Preprint available at http://front (context) - Sun, theorem et al. - 2004
1   Asymptotic behaviour of bi-infinite words (context) - Forys - 2004
1   Zero-mean cosine polynomials which are nonnegative for as lo.. (context) - Gilbert, Smyth
1   A theorem on regular matrices (context) - Perkins - 1961
1   The index of primitivity of a non-negative matrix (context) - Heap, Lynn - 1964
1   the index of imprimitivity of nonnegative matrices (context) - Ptak, Sedlacek - 1958
1   An inequality for non-negative matrices II (context) - Wang - 2002
1   a combinatorial theorem and its application to nonnegative m.. (context) - Ptak - 1958
1   Partial words and a theorem of Fine and Wilf revisited (context) - Blanchet-Sadri, Hegstrom - 2002
1   Improvements on inequalities for non-negative matrices (context) - Bo - 2000
1   The structure of powers of nonnegative matrices II (context) - Heap, Lynn - 1966
1   The number of minimal word chains computing the ThueMorse wo.. (context) - Bousquet-Melou - 1992
1   The structure of powers of nonnegative matrices (context) - Heap, Lynn - 1966
1   Fixed and stationary #-words and #-languages (context) - Head, Lando - 1986
1   On regularity of languages generated by copying systems (context) - Ehrenfeucht, Rozenberg - 1984
1   Mengentheoretische betrachtungen uber das schachspiel (context) - Euwe - 1929
1   The maximum number of zeros in the powers of an indecomposab.. (context) - Marcus, May - 1962
1   the number of positive entries in the powers of a non-negati.. (context) - Pullman - 1964
1   Michigan Math (context) - Lyndon, Schutzenberger et al. - 1962
1   New problems of pattern avoidance - Loftus, Shallit et al. - 1999
1   and combinatorial properties of matrices (context) - Mark, Ptak et al. - 1960
1   Variations on a theorem of Fine & Wilf (context) - Mignosi, Shallit et al. - 2001
1   Weakly self-avoiding words and a construction of Friedman - Shallit, Wang - 2001
1   A generalization of repetition threshold (context) - Ilie, Ochem et al. - 2004
1   the regularity of duplication closure (context) - Dassow, Mitrana et al. - 1999
1   A note on word chains and regular languages (context) - Roth - 1989
1   On infinite two-sided fixed points of morphisms (context) - Shallit, Wang - 2002
1   Rational languages and the Burnside problem (context) - Restivo, Reutenauer - 1985

Documents on the same site (http://etd.uwaterloo.ca/etd/):   More
Multi-Resolution Approximate Inverses - Bridson (1999)   (Correct)
Efficient Simulation of Message-Passing in Distributed-Memory.. - Demaine (1996)   (Correct)
Occurrent Contractarianism: A Preference-Based Ethical Theory - Murray (1994)   (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