Journals in DBLP

Theor. Comput. Sci.
1986, volume: 47, number: 3

1. Zoltán Ésik, Pál Dömösi
   Complete Classes of Automata for the alpha-0-Product. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:1-14 [Journal]
   
2. Karel Culik II, Sheng Yu
   Real-Time, Pseudo Real-Time, and Linear-Time ITA. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:15-26 [Journal]
   
3. Paliath Narendran, Friedrich Otto
   The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:27-38 [Journal]
   
4. J. Howard Johnson
   Rational Equivalence Relations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:39-60 [Journal]
   
5. Andrzej Pelc
   Lie Patterns in Search Procedures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:61-69 [Journal]
   
6. Karel Culik II, Juhani Karhumäki
   The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:71-84 [Journal]
   
7. Leslie G. Valiant, Vijay V. Vazirani
   NP is as Easy as Detecting Unique Solutions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:85-93 [Journal]
   
8. Jean-Pierre Pécuchet
   On the Complementation of Büchi Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:95-98 [Journal]
   
9. Joos Heintz
   On Polynomials with Symmetric Galois Group which Are Easy to Compute. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1986, v:47, n:3, pp:99-105 [Journal]
   
10. Piotr Wyrostek
    On the Size of Unambiguous Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:107-110 [Journal]
    
11. Patrick W. Dymond
    On Nondeterminism in Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:111-120 [Journal]
    
12. Pekka Orponen
    A Classification of Complexity Core Lattices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:121-130 [Journal]
    
13. Klaus W. Wagner
    Some Observations on the Connection Between Counting an Recursion. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:131-147 [Journal]
    
14. Marek Chrobak
    Finite Automata and Unary Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:149-158 [Journal]
    
15. V. Rajkumar Dare, Rani Siromoney
    Subword Topology. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:159-168 [Journal]
    
16. Steven Homer
    On Simple and Creative Sets in NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:169-180 [Journal]
    
17. Jean-Claude Spehner
    Le Calcul Rapide des Melanges de Deux Mots. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:171-203 [Journal]
    
18. Lefteris M. Kirousis, Christos H. Papadimitriou
    Searching and Pebbling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:205-218 [Journal]
    
19. Rainer Parchmann, Jürgen Duske
    Self-Embedding Indexed Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:219-223 [Journal]
    
20. Friedrich Otto
    The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:225-232 [Journal]
    
21. Mauricio Karchmer
    Two Time-Space Tradeoffs for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:237-246 [Journal]
    
22. Yael Maon, Amiram Yehudai
    Balance of Many-Valued Transductions and Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:247-262 [Journal]
    
23. Ker-I Ko, Timothy J. Long, Ding-Zhu Du
    On One-Way Functions and Polynomial-Time Isomorphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:263-276 [Journal]
    
24. Yael Maon, Baruch Schieber, Uzi Vishkin
    Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:277-298 [Journal]
    
25. Ker-I Ko
    On the Continued Fraction Representation of Computable Real Numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:299-313 [Journal]
    
26. Wojciech Rytter
    On the Complexity of Parallel Parsing of General Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:315-321 [Journal]
    
27. J. W. Hong, Q. Zuo
    Lower Bounds on Communication Overlap of Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:323-328 [Journal]
    
28. Andrzej Szalas
    Concerning the Semantic Consequence Relation in First-Order Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:329-334 [Journal]
    
29. Jean-Luc Deleage, Laurent Pierre
    The Rational Index of the Dyck Language D'*-1. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:335-343 [Journal]
    
30. Luis Fariñas del Cerro, Ewa Orlowska
    Corrigendum: DAL-A Logic for Data Analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:345- [Journal]