Journals in DBLP

Theor. Comput. Sci.
1994, volume: 134, number: 1

1. J. A. Anderson
   Semiretracts of a Free Monoid. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:3-11 [Journal]
   
2. Danièle Beauquier, Andreas Podelski
   Rabin Tree Automata and Finite Monoids. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:13-25 [Journal]
   
3. Agnès Bonnier-Rigny, Daniel Krob
   A Complete System of Identities for One-Letter Rational Expressions with Multiplicities in the Tropical Semiring. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:27-50 [Journal]
   
4. Fernanda Botelho, Max H. Garzon
   Boolean Neural Nets are Observable. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:51-61 [Journal]
   
5. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
   A Fast Algorithm for the Unique Decipherability of Multivalued Encodings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:63-78 [Journal]
   
6. Sinisa Crvenkovic, Rozália Sz. Madarász
   On Dynamic Algebras. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:79-86 [Journal]
   
7. Volker Diekert
   A Partial Trace Semantics for Petri Nets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:87-105 [Journal]
   
8. Helmut Jürgensen, Kai Salomaa, Sheng Yu
   Transducers and the Decidability of Independence in Free Monoids. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:107-117 [Journal]
   
9. Alica Kelemenová, Erzsébet Csuhaj-Varjú
   Languages of Colonies. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1994, v:134, n:1, pp:119-130 [Journal]
   
10. Teo Mora
    An Introduction to Commutative and Noncommutative Gröbner Bases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:131-173 [Journal]
    
11. Friedrich Otto, Paliath Narendran
    Codes Modulo Finite Monadic String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:175-188 [Journal]
    
12. Norman R. Reilly
    Bounds on the Variety Generated by Completely Regular Syntactic Monoids from Finite Prefix Codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:189-208 [Journal]
    
13. Jean-Claude Spehner
    A Bijection Between Cliques in Graphs and Factorizations in Free Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:209-223 [Journal]
    
14. Andreas Weber
    Finite-Valued Distance Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:225-251 [Journal]
    
15. Andreas Weber
    Exponential Upper and Lower Bounds for the Order of a Regular Language. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:253-262 [Journal]