Journals in DBLP

Theor. Comput. Sci.
1986, volume: 44, number:

1. Peter Ritzmann
   A Fast Numerical Algorithm for the Composition of Power Series with Complex Coefficients. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:1-16 [Journal]
   
2. François Blanchard, Georges Hansel
   Systèmes Codés. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:17-49 [Journal]
   
3. Daniel Leivant
   Typing and Computational Properties of Lambda Expressions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:51-68 [Journal]
   
4. Louis E. Rosier, Hsu-Chun Yen
   Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:69-105 [Journal]
   
5. François Blanchard, Servet Martínez A.
   Points d'Orbite Dense de Certains Langages de Mots Infinis. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:107-110 [Journal]
   
6. Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar
   On Pebble Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:111-121 [Journal]
   
7. E. Paul
   On Solving the Equality Problem in Theories Defined by Horn Clauses. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:127-153 [Journal]
   
8. Ernst L. Leiss
   Generalized Language Equations with Multiple Solutions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:155-174 [Journal]
   
9. Yuji Kobayashi
   Repetition-Free Words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:44, n:, pp:175-197 [Journal]
   
10. Volker Diekert
    Complete Semi-Thue Systems for Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:199-208 [Journal]
    
11. Tuvi Etzion
    An Algorithm for Generating Shift-Register Cycles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:209-224 [Journal]
    
12. Satoshi Okawa, Sadaki Hirose, Masaaki Yoneda
    On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:225-228 [Journal]
    
13. Friedrich J. Urbanek
    On Greibach Normal Form Construction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:229-236 [Journal]
    
14. Paliath Narendran
    On the Equivalence Problem for Regular Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:237-245 [Journal]
    
15. Paul E. S. Dunne
    The Complexity of Central Slice Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:247-257 [Journal]
    
16. Masako Takahashi
    The Greatest Fixed-Points and Rational Omega-Tree Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:259-274 [Journal]
    
17. Hans-Jörg Kreowski, Anne Wilharm
    Net Processes Correspond to Derivation Processes in Graph Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:275-305 [Journal]
    
18. William F. Dowling, Jean H. Gallier
    Continuation Semantics for Flowgraph Equations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:307-331 [Journal]
    
19. Ebbe Thue Poulsen
    The Ehrenfeucht Conjecture: An Algebra-Framework for Its Proof. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:333-339 [Journal]