Journals in DBLP

Theor. Comput. Sci.
2007, volume: 380, number: 3

1. Srecko Brlek, Christophe Reutenauer
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:219- [Journal]
   
2. Boris Adamczewski, Jean-Paul Allouche
   Reversals and palindromes in continued fractions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:220-237 [Journal]
   
3. Petr Ambroz, Christiane Frougny
   On alpha-adic expansions in Pisot bases. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:238-250 [Journal]
   
4. Pierre Arnoux, Valérie Berthé, Thomas Fernique, Damien Jamet
   Functional stepped surfaces, flips, and generalized substitutions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:251-265 [Journal]
   
5. Peter Balázi, Zuzana Masáková, Edita Pelantová
   Factor versus palindromic complexity of uniformly recurrent infinite words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:266-275 [Journal]
   
6. Valérie Berthé, Bertrand Nouvel
   Discrete rotations and symbolic dynamics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:276-285 [Journal]
   
7. Jean-Pierre Borel
   A geometrical characterization of factors of multidimensional Billiard words and some applications. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:286-303 [Journal]
   
8. Julien Cassaigne, Anna E. Frid
   On the arithmetical complexity of Sturmian words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:304-316 [Journal]
   
9. Thomas Fernique
   Local rule substitutions and stepped surfaces. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:380, n:3, pp:317-329 [Journal]
   
10. Amy Glen
    Powers in a class of A-strict standard episturmian words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:330-354 [Journal]
    
11. Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux
    Extension of the decidability of the marked PCP to instances with unique blocks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:355-362 [Journal]
    
12. S. Stepán Holub, Juha Kortelainen
    On systems of word equations with simple loop sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:363-372 [Journal]
    
13. Lucian Ilie
    A note on the number of squares in a word. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:373-376 [Journal]
    
14. Arto Lepistö, Francesco Pappalardi, Kalle Saari
    Transposition invariant words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:377-387 [Journal]
    
15. Pascal Ochem
    Letter frequency in infinite repetition-free words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:388-392 [Journal]
    
16. Gwénaël Richomme
    Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:393-400 [Journal]
    
17. Maurice H. ter Beek, Jetty Kleijn
    Infinite unfair shuffles and associativity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:401-410 [Journal]