Information and Control, Volume 57

Volume 57, Number 1, 1983

• Tsutomu Maimiura:
  Tree Automata and Attribute Grammars. 1-20
  
• Dung T. Huynh:
  Commutative Grammars: The Complexity of Uniform Word Problems. 21-39
  
• Stuart A. Kurtz:
  On the Random Oracle Hypothesis. 40-47
  
• Alexei P. Stolboushkin, Michael A. Taitslin:
  Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic. 48-55
  
• Joseph Y. Halpern:
  Deterministic Process Logic is Elementary. 56-89
  

Volume 57, Number 2-3, 1983

• Larry J. Stockmeyer:
  Optimal Orientations of Cells in Slicing Floorplan Designs. 91-101
  
• William G. Golson, William C. Rounds:
  Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees. 102-124
  
• Ursula Goltz, Wolfgang Reisig:
  The Non-sequential Behavior of Petri Nets. 125-147
  
• Mitchell Wand:
  Loops in Combinator-Based Compilers. 148-164
  
• L. Csirmaz:
  On the Strength of ``Sometimes'' and ``Always'' in Program Verification. 165-179
  
• Etienne Grandjean:
  Complexity of the First-Order Theory of Almost All Finite Structures. 180-204
  
• Antonio Restivo, Christophe Reutenauer:
  Some Applications of a Theorem of Shirshov to Language Theory. 205-213
  

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