Information and Control, Volume 53

Volume 53, Number 1-2, 1982

• Wolfgang J. Paul:
  On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear Time. 1-8
  
• Prem Nath, Man Mohan Kaur:
  On Some Characterizations of the Shannon Entropy Using Extreme Symmetry and Block Symmetry. 9-20
  
• Ker-I Ko:
  Some Negative Results on the Computational Complexity of Total Variation and Differentiation. 21-31
  
• Daniel N. Osherson, Michael Stob, Scott Weinstein:
  Learning Strategies. 32-51
  
• Seppo Sippu:
  Derivational Complexity of Context-Free Grammars. 52-65
  
• J. Martin Borden:
  Optimal Asymmetric Error Detecting Codes. 66-73
  
• William M. Kantor:
  An Exponential Number of Generalized Kerdock Codes. 74-80
  
• Nariyasu Minamide:
  An Extension of the Entropy Theorem for Parameter Estimation. 81-90
  
• Joseph Sifakis:
  Global and Local Invariants in Transition Systems. 91-107
  
• George M. Reed, Azriel Rosenfeld:
  Recognition of Surfaces in Three-Dimensional Digital Images. 108-120
  
• Ulrich Golze, Lutz Priese:
  Petri Net Implementations by a Universal Cell Space. 121-138
  

Volume 53, Number 3, 1982

• Seppo Sippu, Eljas Soisalon-Soininen:
  On LL(k) Parsing. 141-164
  
• Daniel J. Lehmann, Saharon Shelah:
  Reasoning with Time and Chance. 165-198
  
• Kosaburo Hashiguchi:
  Regular Languages of Star Height One. 199-210
  
• Christos H. Papadimitriou, John N. Tsitsiklis:
  On the Complexity of Designing Distributed Protocols. 211-218
  

Last update Sat May 25 20:20:21 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page