Journals in DBLP

Theor. Comput. Sci.
1988, volume: 61, number:

1. Jeffrey Shallit
   A Generalization of Automatic Sequences. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:1-16 [Journal]
   
2. Pál Dömösi, Zoltán Ésik
   Critical Classes for the alpha_0-Product. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:17-24 [Journal]
   
3. Ivan Mezník
   On a Subclass of Infinite-Regular Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:25-32 [Journal]
   
4. Xin He
   A Nearly Optimal Parallel Algorithm for Constructing Maximal Independent Set in Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:33-47 [Journal]
   
5. Carl-Johan H. Seger, Janusz A. Brzozowski
   An Optimistic Ternary Simulation of Gate Races. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:49-66 [Journal]
   
6. P. M. van den Broek
   Comparison of Two Graph-Rewrite Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:67-81 [Journal]
   
7. Satish R. Thatte
   Implementing First-Order Rewriting with Constructor Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:83-92 [Journal]
   
8. Robert Cori, Eric Sopena, Michel Latteux, Yves Roos
   2-Asynchronous Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:93-102 [Journal]
   
9. Ronald V. Book, Ding-Zhu Du
   The Structure of Generalized Complexity Cores. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1988, v:61, n:, pp:103-119 [Journal]
   
10. Elias Dahlhaus, Marek Karpinski
    Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:121-136 [Journal]
    
11. Tetsuo Moriya, Hideki Yamasaki
    Accepting Conditions for Automata on omega-Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:137-147 [Journal]
    
12. K. N. King
    Alternating Multihead Finite Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:149-174 [Journal]
    
13. Giuseppe Di Battista, Roberto Tamassia
    Algorithms for Plane Representations of Acyclic Digraphs. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:175-198 [Journal]
    
14. Jay L. Gischer
    The Equational Theory of Pomsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:199-224 [Journal]
    
15. Werner Alexi
    Extraction and Verification of Programs by Analysis of Formal Proofs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:225-258 [Journal]
    
16. George Gargov, Solomon Passy
    Determinism and Looping in Combinatory PDL. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:259-277 [Journal]
    
17. Ludwig Staiger
    Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:279-282 [Journal]
    
18. Thomas Kretschmer
    A Closure Property of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:283-287 [Journal]
    
19. André Arnold
    Logical Definability of Fixed Points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:289-297 [Journal]
    
20. Edward G. Belaga
    Bilinear Mincing Rank. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:299-306 [Journal]
    
21. Nimrod Megiddo, Uzi Vishkin
    On Finding a Minimum Dominating Set in a Tournament. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:307-316 [Journal]
    
22. Richard Kennaway
    On ``On Graph Rewritings'' (Corrigendum). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:317-320 [Journal]