Journals in DBLP

Theor. Comput. Sci.
1991, volume: 85, number: 1

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