Theoretical Informatics and Applications

Vol. 41 No. 3 (July-September 2007)

• Decidability of code properties     p. 243
  Henning Fernau, Klaus Reinhardt and Ludwig Staiger
  Abstract | PDF file (222.2 KB) | References



• An upper bound for transforming self-verifying automata into deterministic ones     p. 261
  Ira Assent and Sebastian Seibert
  Abstract | PDF file (104.2 KB) | References



• Substitutions par des motifs en dimension 1     p. 267
  N. Pytheas Fogg
  Abstract | PDF file (219.5 KB) | References



• A graph approach to computing nondeterminacy in substitutional dynamical systems     p. 285
  Toke M. Carlsen and Søren Eilers
  Abstract | PDF file (276.5 KB) | References



• Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers     p. 307
  Lubomíra Balková, Edita Pelantová and Ondrej Turek
  Abstract | PDF file (256.5 KB) | References



• On substitution invariant Sturmian words: an application of Rauzy fractals     p. 329
  Valérie Berthé, Hiromi Ei, Shunji Ito and Hui Rao
  Abstract | PDF file (249.0 KB) | References