JCSS, Volume 26

Volume 26, Number 1, February 1983

• Douglas Comer:
  Effects of Updates on Optimality in Tries. 1-13
  
• Michel Latteux:
  Langages à un Compteur. 14-33
  
• Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg:
  Context Free Normal Systems and ETOL Systems. 34-46
  
• Oscar H. Ibarra, Brian S. Leininger:
  On the Zero-Inequivalence Problem for Loop Programs. 47-64
  
• David A. Carlson, John E. Savage:
  Size-Space Tradeoffs for Oblivious Computations. 65-81
  
• Jürgen Albert, Derick Wood:
  Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages. 82-91
  
• Dave Riffelmacher:
  Multiplicative Complexity and Algebraic Structure. 92-106
  
• Toshimasa Watanabe, Akira Nakamura:
  On the Transformation Semigroups of Finite Automata. 107-138
  
• John J. Grefenstette:
  Network Structure and the Firing Squad Synchronization Problem. 139-152
  

Volume 26, Number 2, April 1983

• Esko Ukkonen:
  Lower Bounds on the Size of Deterministic Parsers. 153-170
  
• Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier:
  On the Equality of Grammatical Families. 171-196
  
• Takao Asano, Tomio Hirata:
  Edge-Contraction Problems. 197-208
  
• Ker-I Ko:
  On Self-Reducibility and Weak P-Selectivity. 209-221
  
• David Harel, Amir Pnueli, Jonathan Stavi:
  Propositional Dynamic Logic of Nonregular Programs. 222-243
  
• Seppo Sippu, Eljas Soisalon-Soininen:
  On the Complexity of LL(k) Testing. 244-268
  
• Maurice Tchuente:
  Computation of Boolean Functions on Networks of Binary Automata. 269-277
  

Volume 26, Number 3, June 1983

• Zvi Galil, Joel I. Seiferas:
  Time-Space-Optimal String Matching. 280-294
  
• David E. Muller, Paul E. Schupp:
  Groups, the Theory of Ends, and Context-Free Languages. 295-310
  
• Deborah Joseph:
  Polynomial Time Computations in Models of ET. 311-338
  
• Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller:
  An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. 339-361
  
• Daniel Dominic Sleator, Robert Endre Tarjan:
  A Data Structure for Dynamic Trees. 362-391
  
• Faith E. Fich:
  Lower Bounds for the Cycle Detection Problem. 392-409
  
• K. N. Venkataraman, Ann Yasuhara, Frank M. Hawrusik:
  A View of Computability on Term Algebras. 410-471
  

Last update Wed May 22 17:56:17 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page