Theoretical Computer Science, Volume 218

Volume 218, Number 1, 28 April 1999

• Julien Cassaigne:
  Limit Values of the Recurrence Quotient of Sturmian Sequences. 3-12
  Electronic Edition (link) BibTeX
• Aldo de Luca:
  On the Combinatorics of Finite Words. 13-39
  Electronic Edition (link) BibTeX
• Guy Melançon:
  Lyndon Words and Singular Factors of Sturmian Words. 41-59
  Electronic Edition (link) BibTeX
• Arturo Carpi:
  On Abelian Squares and Substitutions. 61-81
  Electronic Edition (link) BibTeX
• Maria Gabriella Castelli, Filippo Mignosi, Antonio Restivo:
  Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words. 83-94
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel, Jamie Simpson:
  The Exact Number of Squares in Fibonacci Words. 95-106
  Electronic Edition (link) BibTeX
• Véronique Bruyère, Dominique Perrin:
  Maximal Bifix Codes. 107-121
  Electronic Edition (link) BibTeX
• Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
  Generalized Factorizations of Words and Their Algorithmic Properties. 123-133
  Electronic Edition (link) BibTeX
• Jean Berstel, Luc Boasson:
  Partial Words and a Theorem of Fine and Wilf. 135-141
  Electronic Edition (link) BibTeX
• Jean-Paul Allouche:
  Transcendence of Formal Power Series with Rational Coefficients. 143-160
  Electronic Edition (link) BibTeX
• Roman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov:
  On Repetition-Free Binary Words of Minimal Density. 161-175
  Electronic Edition (link) BibTeX
• Sébastien Ferenczi, Zoltán Kása:
  Complexity for Finite Factors of Infinite Sequences. 177-195
  Electronic Edition (link) BibTeX
• Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter:
  Constant-Space String-Matching in Sublinear Average Time. 197-203
  Electronic Edition (link) BibTeX
• Costas S. Iliopoulos, Laurent Mouchard:
  Quasiperiodicity and String Covering. 205-216
  Electronic Edition (link) BibTeX

Volume 218, Number 2, 6 May 1999

• Jacques Mazoyer, Renzo Pinzani, Jean-Guy Penaud:
  Avant Propos. 217-218
  Electronic Edition (link) BibTeX
• Elena Barcucci, Alberto Del Lungo, Elisa Pergola:
  Random Generation of Trees and Other Combinatorial Objects. 219-232
  Electronic Edition (link) BibTeX
• Alain Denise, Paul Zimmermann:
  Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic. 233-248
  Electronic Edition (link) BibTeX
• Guy Louchard:
  Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms. 249-262
  Electronic Edition (link) BibTeX
• Mohamed Mosbah, Nasser Saheb:
  Non-Uniform Random Spanning Trees on Weighted Graphs. 263-271
  Electronic Edition (link) BibTeX
• Gilles d'Andréa, Christophe Fiorio:
  Maximal Superpositions of Horizontally Convex Polyominoes. 273-283
  Electronic Edition (link) BibTeX
• Eric Goles Ch., Ivan Rapaport:
  Tiling Allowing Rotations Only. 285-295
  Electronic Edition (link) BibTeX
• David Simplot:
  A Characterization of Recognizable Picture Languages by Tilings by Finite Sets. 297-323
  Electronic Edition (link) BibTeX
• Véronique Terrier:
  Two-Dimensional Cellular Automata Recognizer. 325-346
  Electronic Edition (link) BibTeX
• Marianne Delorme, Jacques Mazoyer, Laure Tougne:
  Discrete Parabolas and Circles on 2D Cellular Automata. 347-417
  Electronic Edition (link) BibTeX