Theoretical Informatics and Applications

Vol. 40 No. 3 (July-September 2006)

Special Issue: Word Avoidability Complexity And Morphisms (WACAM)

• Foreword     p. 405
  Gwénaël Richomme
  Abstract | PDF file (23.2 KB)



• Well quasi-orders, unavoidable sets, and derivation systems     p. 407
  Flavio D'Alessandro and Stefano Varricchio
  Abstract | PDF file (239 KB) | References



• A generator of morphisms for infinite words     p. 427
  Pascal Ochem
  Abstract | PDF file (161 KB) | References



• On possible growths of arithmetical complexity     p. 443
  Anna E. Frid
  Abstract | PDF file (269 KB) | References



• Transcendence of numbers with an expansion in a subclass of complexity 2n + 1     p. 459
  Tomi Kärki
  Abstract | PDF file (359 KB) | References



• Squares and overlaps in the Thue-Morse sequence and some variants     p. 473
  Shandy Brown, Narad Rampersad, Jeffrey Shallit and Troy Vasiga
  Abstract | PDF file (164 KB) | References



• Deterministic blow-ups of minimal NFA's     p. 485
  Galina Jirásková
  Abstract | PDF file (223 KB) | References



• Note on the complexity of Las Vegas automata problems     p. 501
  Galina Jirásková
  Abstract | PDF file (147 KB) | References



• A little more about morphic Sturmian words     p. 511
  Isabelle Fagnot
  Abstract | PDF file (134 KB) | References