Journals in DBLP

Theor. Comput. Sci.
1991, volume: 88, number: 2

1. Hiroyuki Seki, T. Matsumura, Mamoru Fujii, Tadao Kasami
   On Multiple Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:191-229 [Journal]
   
2. Ulrich Huckenbeck
   A Result about the Power of Geometric Oracle Machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:231-251 [Journal]
   
3. Zoltán Fülöp
   A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:253-268 [Journal]
   
4. L. Peeva
   Equivalence, Reduction and Minimization of Finite Automata over Semirings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:269-285 [Journal]
   
5. Katsushi Inoue, Akira Ito, Itsuo Takanami
   A Note on Real-Time One-Way Alternating Multicounter Machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:287-296 [Journal]
   
6. A. Bebják, Ivana Stefáneková
   Separation of Deterministic, Nondeterministic and Alternating Complexity Classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:297-311 [Journal]
   
7. W. Baur
   On the Algebraic Complexity of Rational Iteration Procedures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:313-324 [Journal]
   
8. Andreas Weber, Helmut Seidl
   On the Degree of Ambiguity of Finite Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:325-349 [Journal]
   
9. H. Yoo, Kosaburo Hashiguchi
   Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1). [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:2, pp:351-363 [Journal]
   
10. Patrice Séébold
    Fibonacci Morphisms and Sturmian Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:2, pp:365-384 [Journal]