Home
 
  • Journals
  • Seminars
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Books
  • Lecture notes
  • Theses
  • Authors
  • All
  • Author
  • Title
  • References
  • Keywords
  • Full text
NOT
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
  • Volume 41 (2007)
  • no. 3

Table of contents


Decidability of code properties
Fernau, Henning; Reinhardt, Klaus; Staiger, Ludwig
p. 243-259

An upper bound for transforming self-verifying automata into deterministic ones
Assent, Ira; Seibert, Sebastian
p. 261-265

Substitutions par des motifs en dimension 1
Pytheas Fogg, N.
p. 267-284

A graph approach to computing nondeterminacy in substitutional dynamical systems
Carlsen, Toke M.; Eilers, Søren
p. 285-306

Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
Balková, Lubomíra; Pelantová, Edita; Turek, Ondřej
p. 307-328

On substitution invariant sturmian words : an application of Rauzy fractals
Berthé, Valérie; Ei, Hiromi; Ito, Shunji; Rao, Hui
p. 329-349
  • About
  • Help
  • Legal notice
  • Contact
 

Published by

 

Supported by

 
 

Partner of