Theoretical Computer Science, Volume 85

Volume 85, Number 1, 1991

• Jie Wang:
  On p-Creative Sets and p-Completely Creative Sets. 1-31
  
• Jeanne Devolder, Igor Litovsky:
  Finitely Generated bi-omega-Languages. 33-52
  
• Oscar H. Ibarra, Hui Wang:
  Parallel Parsing on a One-Way Linear Array of Finite-State Machines. 53-74
  
• Steven Lindell:
  An Analysis of Fixed-Point Queries on Binary Trees. 75-95
  
• Pieter Hendrik Rodenburg:
  Algebraic Specifiability of Data Types with minimal Computable Parameters. 97-116
  
• Wojciech Szpankowski:
  A Characterization of Digital Search Trees from the Successful Search Viewpoint. 117-134
  
• Miroslaw Kutylowski:
  Multihead One-Way Finite Automata. 135-153
  
• Ingo Wegener:
  The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits. 155-170
  
• Alessandra Cherubini, Claudio Citrini, Stefano Crespi-Reghizzi, Dino Mandrioli:
  QRT FIFO Automata, Breath-First Grammars and Their Relations. 171-203
  
• Pascal Michel:
  An NP-Complete Language Accepted in Linear Time by a One-Tape Turing Machine. 205-212
  

Volume 85, Number 2, 1991

• Marta Cialdea:
  Resolution for Some First-Order Modal Systems. 213-229
  
• Narjes Doggaz, Claude Kirchner:
  Completion for Unification. 231-251
  
• Eric Sopena:
  Hypermap Rewriting: A Combinatorial Approach. 253-281
  
• Robert D. Tennent, J. K. Tobin:
  Continuations in Possible-World Semantics. 283-303
  
• Jürgen Kämper:
  Nonuniform Proof Systems: A New Framework to Describe Nonuniform and Probabilistic Complexity Classes. 305-331
  
• Shigeki Goto:
  Proof Normalization with Nonstandard Objects. 333-351
  
• Inge Bethke:
  Coherence Spaces are Untopological. 353-357
  

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