Journals in DBLP

Theor. Comput. Sci.
1985, volume: 35, number:

1. Klaus-Jörn Lange, Emo Welzl
   Recurrent Words and Simultaneous Growth in T0L Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:1-15 [Journal]
   
2. Jacques Stern
   Characterizations of Some Classes of Regular Events. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:17-42 [Journal]
   
3. Stephen L. Bloom, Douglas R. Troeger
   A Logical Characterization of Observation Equivalence. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:43-53 [Journal]
   
4. Herbert Edelsbrunner
   Finding Transversals for Sets of Simple Geometric Figures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:55-69 [Journal]
   
5. Yves Métivier
   Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:71-87 [Journal]
   
6. Christophe Benoit
   Axiomatisation des Tests. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:89-107 [Journal]
   
7. Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran
   An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:109-114 [Journal]
   
8. Jean-Pierre Pécuchet
   Automates Boustrophédon et Mots Infinis. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:115-122 [Journal]
   
9. Laurent Fribourg
   A Superposition Oriented Theorem Prover. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1985, v:35, n:, pp:129-164 [Journal]
   
10. Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
    On the Existence of Acyclic Views in a Database Scheme. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:165-177 [Journal]
    
11. Robert Cori, Yves Métivier
    Recognizable Subsets of Some Partially Abelian Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:179-189 [Journal]
    
12. Gérard Memmi, Alain Finkel
    An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:191-214 [Journal]
    
13. Kojiro Kobayashi
    On Proving Time Constructibility of Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:215-225 [Journal]
    
14. Paliath Narendran, Friedrich Otto
    Complexity Results on the Conjugacy Problem for Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:227-243 [Journal]
    
15. David A. Plaisted
    Complete Divisibility Problems for Slowly Utilized Oracles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:245-260 [Journal]
    
16. Sadaki Hirose, Satoshi Okawa, Masaaki Yoneda
    A Homomorphic Characterization of Recursively Enumerable Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:261-269 [Journal]
    
17. Jean-Eric Pin, Jacques Sakarovitch
    Une Application de la Representation Matricielle des Transductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:271-293 [Journal]
    
18. Tom Head, John Wilkinson
    Code Properties and Homomorphisms of D0L Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:295-312 [Journal]
    
19. Ernst L. Leiss
    On Classes of Tractable Unrestricted Regular Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:313-327 [Journal]
    
20. Michio Oyamaguchi
    On the Data Type Extension Problem for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:329-336 [Journal]
    
21. Deepak Kapur, Paliath Narendran
    A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:337-344 [Journal]
    
22. Ildikó Sain
    A Simple Proof for the Completeness of Floyd's Method. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:345-348 [Journal]