Theoretical Computer Science, Volume 301

Number 301, Volume 1-3, 14 May 2003

• Yiannis N. Moschovakis:
  On primitive recursive algorithms and the greatest common divisor function. 1-30
  
• Andrei Kelarev, Olga Sokratova:
  On congruences of automata defined by directed graphs. 31-43
  
• Martin Sauerhoff:
  Approximation of boolean functions by combinatorial rectangles. 45-78
  
• Masashi Katsura, Yuji Kobayashi, Friedrich Otto:
  Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions. 79-101
  
• Kyriakos N. Sgarbas, Nikos Fakotakis, George K. Kokkinakis:
  Optimal insertion in deterministic DAWGs. 103-117
  
• Alexandros V. Gerbessiotis, Constantinos J. Siniolakis:
  Architecture independent parallel selection with applications to parallel priority queues. 119-142
  
• Richard Nock:
  Complexity in the case against accuracy estimation. 143-165
  
• Véronique Terrier:
  Two-dimensional cellular automata and deterministic on-line tessalation automata. 167-186
  
• Arto Salomaa, Petr Sosík:
  Watson-Crick D0L systems: the power of one transition. 187-200
  
• Claudio Ferretti, Giancarlo Mauri, Gheorghe Paun, Claudio Zandron:
  On three variants of rewriting P systems. 201-215
  
• Olivier Finkel:
  Ambiguity in omega context free languages. 217-270
  
• Rodica Boliac, Vadim V. Lozin:
  Independent domination in finitely defined classes of graphs. 271-284
  
• Manfred Peter:
  The asymptotic distribution of elements in automatic sequences. 285-312
  
• Andries P. J. van der Walt, Sigrid Ewert:
  A property of random context picture grammars. 313-320
  
• John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson:
  Euclidean strings. 321-340
  
• Enrico Formenti:
  On the sensitivity of additive cellular automata in Besicovitch topologies. 341-354
  
• Paola Flocchini, Alessandro Roncato, Nicola Santoro:
  Computing on anonymous networks with sense of direction. 355-379
  
• Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang:
  Efficient minus and signed domination in graphs. 381-397
  
• Nguyen Huong Lam:
  Completing comma-free codes. 399-415
  
• Igor Dolinka:
  The multiplicative fragment of the Yanov equational theory. 417-425
  
• Leonidas Georgiadis:
  Arborescence optimization problems solvable by Edmonds' algorithm. 427-437
  
• Marcy Barge, Beverly Diamond, Charles Holton:
  Asymptotic orbits of primitive substitutions. 439-450
  
• Kazuo Iwama, Akihiro Matsuura, Mike Paterson:
  A family of NFAs which need 2n- deterministic states. 451-462
  
• Van Bang Le, Bert Randerath:
  On stable cutsets in line graphs. 463-475
  
• Joe Sawada:
  A fast algorithm to generate necklaces with fixed content. 477-489
  
• L. H. Harper:
  On the bandwidth of a Hamming graph. 491-498