Theoretical Computer Science, Volume 293

Volume 293, Number 2, February 2003

• Anton Nijholt, Giuseppe Scollo, Dirk Heylen:
  Editorial. 237-241
  
• Aravind K. Joshi:
  A note on the strong and weak generative powers of formal systems. 243-259
  
• Hans-Peter Kolb, Jens Michaelis, Uwe Mönnich, Frank Morawietz:
  An operational and denotational approach to non-context-freeness. 261-289
  
• James Rogers:
  wMSO theories as grammar formalisms. 291-320
  
• Denys Duchier:
  Dominance constraints with Boolean connectives: a model-eliminative treatment. 321-343
  
• Edward P. Stabler, Edward L. Keenan:
  Structural similarity within and among languages. 345-363
  
• Karl-Michael Schneider:
  Tabular parsing and algebraic transformations. 365-389
  
• Pierre Boullier:
  Counting with range concatenation grammars. 391-416
  
• Peter R. J. Asveld:
  Algebraic aspects of families of fuzzy languages. 417-445
  
• Domenico Cantone, Andrea Formisano, Eugenio G. Omodeo, Calogero G. Zarba:
  Compiling dyadic first-order specifications into map algebra. 447-475
  

Volume 293, Number 3, February 2003

• Colin J. Fidge:
  Foreword. 477
  
• Salvatore La Torre, Margherita Napoli:
  Finite automata on timed omega-trees. 479-505
  
• Annabelle McIver, Carroll Morgan:
  Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL. 507-534
  
• Shane Saunders, Tadao Takaoka:
  Improved shortest path algorithms for nearly acyclic graphs. 535-556
  
• Peter Schachte:
  Precise goal-independent abstract interpretation of constraint logic programs. 557-577
  

Last update Tue Feb 14 04:22:57 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page