Journals in DBLP

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

1. Horst Luckhardt
   New Formally Undecidable Propositions: Non-Trivial Lower Bounds on Proof Complexity and Related Theorems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:169-188 [Journal]
   
2. David Mauro
   Derived Linear Systems of Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:189-203 [Journal]
   
3. Martin J. M. de Boer, Aristid Lindenmayer, Zsolt Tuza
   A Periodic Division Pattern that Cannot be Generated by D0L Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:205-218 [Journal]
   
4. Salah Labhalla
   Complexité du Calcul du Développement d'un Nombre Réel en Fractions Continues. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:219-235 [Journal]
   
5. Shigeko Seki, Youichi Kobuchi
   On Standard Locally Catenative L Schemes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:237-248 [Journal]
   
6. Emanuela Fachini, Andrea Maggiolo-Schettini, Giovanni Resta, Davide Sangiorgi
   Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:249-260 [Journal]
   
7. Gerhard Küster
   On the Hurwitz Product of Formal Power Series and Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:261-273 [Journal]
   
8. Yossi Azar
   Parallel Comparison Merging of Many-Ordered Lists. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:275-285 [Journal]
   
9. Sukhamay Kundu
   Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:83, n:2, pp:287-300 [Journal]
   
10. Joëlle Cohen-Chesnot
    On the Expressive Power of Temporal Logic for Infinite Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:301-312 [Journal]
    
11. Lane A. Hemachandra, Gerd Wechsung
    Kolmogorov Characterizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:313-322 [Journal]
    
12. Andrzej Wlodzimierz Mostowski
    Hierarchies of Weak Automata and Weak Monadic Formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:323-335 [Journal]
    
13. Osamu Watanabe
    On the p-Isomorphism Conjecture. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:337-343 [Journal]