Journals in DBLP

Theor. Comput. Sci.
2002, volume: 273, number: 1-2

1. Jean Neraud
   WORDS '99 - Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:1-3 [Journal]
   
2. Tom C. Brown
   Applications of standard Sturmian words to elementary number theory. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:5-9 [Journal]
   
3. Flavio D'Alessandro
   A combinatorial problem on Trapezoidal words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:11-33 [Journal]
   
4. Alex Heinis
   The P(n)/n-function for bi-infinite words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:35-46 [Journal]
   
5. Jean Berstel, Luc Boasson
   Shuffle factorization is unique. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:47-67 [Journal]
   
6. Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger
   The commutation of finite sets: a challenging problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:69-79 [Journal]
   
7. Juhani Karhumäki, Ján Manuch
   Multiple factorizations of words and defect effect. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:81-97 [Journal]
   
8. Filippo Mignosi, Antonio Restivo, Marinella Sciortino
   Words and forbidden factors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:99-117 [Journal]
   
9. Gwénaël Richomme, Francis Wlazinski
   Some results on k-power-free morphisms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:273, n:1-2, pp:119-142 [Journal]
   
10. Aldo de Luca
    Some combinatorial results on Bernoulli sets and codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:143-165 [Journal]
    
11. Yannick Guesnet
    On maximal codes with a finite interpreting delay. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:167-183 [Journal]
    
12. Jean Neraud, Carla Selmi
    Locally complete sets and finite decomposable codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:185-196 [Journal]
    
13. Valérie Berthé, Robert Tijdeman
    Balance properties of multi-dimensional words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:197-224 [Journal]
    
14. Zoltán Ésik
    Axiomatizing the subsumption and subword preorders on finite and infinite partial words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:225-248 [Journal]
    
15. Christian Mauduit
    Finite and infinite pseudorandom binary words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:249-261 [Journal]
    
16. V. Malyshev
    Quantum evolution of words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:263-269 [Journal]
    
17. M. Bigotte, G. Jacob, N. E. Oussous, M. Petitot
    Lyndon words and shuffle algebras for generating the coloured multiple zeta values relations tables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:271-282 [Journal]
    
18. Gérard Duchamp, Éric Laugerotte, Jean-Gabriel Luque
    On the support of graph Lie algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:283-294 [Journal]
    
19. Sylvia B. Encheva, Gérard D. Cohen
    Frameproof codes against limited coalitions of pirates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:295-304 [Journal]