Journals in DBLP

Theor. Comput. Sci.
2003, volume: 292, number: 1

1. Patrice Séébold
   Foreword. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:1- [Journal]
   
2. 
   Publications of Jean Berstel. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:3-7 [Journal]
   
3. Jean-Paul Allouche, Michael Baake, Julien Cassaigne, David Damanik
   Palindrome complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:9-31 [Journal]
   
4. Holger Austinat, Volker Diekert, Ulrich Hertrampf
   A structural property of regular frequency computations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:33-43 [Journal]
   
5. Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
   Squaring transducers: an efficient procedure for deciding functionality and sequentiality. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:45-63 [Journal]
   
6. Danièle Beauquier
   On probabilistic timed automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:65-84 [Journal]
   
7. Srecko Brlek, Christophe Reutenauer
   On a valuation of rational subsets of Z^k Dédié à Jean Berstel [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:85-96 [Journal]
   
8. Véronique Bruyère
   Cumulative defect. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:97-109 [Journal]
   
9. Arturo Carpi, Aldo de Luca
   Semiperiodic words and root-conjugacy. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:111-130 [Journal]
   
10. Christian Choffrut
    Minimizing subsequential transducers: a survey. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:131-143 [Journal]
    
11. Philippe Chrétienne, Francis Sourd
    PERT scheduling with convex cost functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:145-164 [Journal]
    
12. Robert Cori, Gilles Schaeffer
    Description trees and Tutte formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:165-183 [Journal]
    
13. Maxime Crochemore
    Reducing space for index implementation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:185-197 [Journal]
    
14. Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg
    Formal systems for gene assembly in ciliates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:199-219 [Journal]
    
15. Christiane Frougny
    On-line digit set conversion in real base. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:221-235 [Journal]
    
16. Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
    A defect theorem for bi-infinite words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:237-243 [Journal]
    
17. Filippo Mignosi, Antonio Restivo, Pedro V. Silva
    On Fine and Wilf's theorem for bidimensional words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:245-262 [Journal]
    
18. Arto Salomaa
    Composition sequences for functions over a finite domain. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:263-281 [Journal]
    
19. Patrice Séébold
    On some generalizations of the Thue-Morse morphism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:283-298 [Journal]
    
20. Wolfgang Thomas
    Uniform and nonuniform recognizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:299-316 [Journal]
    
21. Jean-Eric Pin
    Algebraic tools for the concatenation product. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:317-342 [Journal]