Theoretical Computer Science, Volume 25

Volume 25, 1983

• A. J. Kfoury:
  Definability by Programs in First-Order Structures. 1-66
  
• Evelyn Nelson:
  Iterative Algebras. 67-94
  
• Bruno Courcelle:
  Fundamental Properties of Infinite Trees. 95-169
  
• Colm Ó'Dúnlaing:
  Infinite Regular Thue Systems. 171-192
  
• John Case, Carl Smith:
  Comparison of Identification Criteria for Machine Inductive Inference. 193-220
  
• Lutz Priese:
  Automata and Concurrency. 221-265
  
• Robin Milner:
  Calculi for Synchrony and Asynchrony. 267-310
  
• Rüdiger Valk:
  Infinite Behaviour of Petri Nets. 311-341
  

Last update Sat May 18 17:39:43 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page