Journals in DBLP

Theor. Comput. Sci.
2004, volume: 327, number: 3

1. Zoltán Ésik, Zoltán Fülöp
   Foreword. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:223-224 [Journal]
   
2. Dimitry S. Ananichev, Mikhail V. Volkov
   Synchronizing monotonic automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:225-239 [Journal]
   
3. Jean-Marc Champarnaud, Fabien Coulon
   NFA reduction algorithms by means of regular inequalities. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:241-253 [Journal]
   
4. Flavio D'Alessandro, Stefano Varricchio
   Well quasi-orders and context-free grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:255-268 [Journal]
   
5. Diego de Falco, Massimiliano Goldwurm, Violetta Lonati
   Frequency of symbol occurrences in bicomponent stochastic models. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:269-300 [Journal]
   
6. Dieter Hofbauer, Johannes Waldmann
   Deleting string rewriting systems preserve regularity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:301-317 [Journal]
   
7. Markus Holzer, Barbara König
   On deterministic finite automata and syntactic monoid size. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:319-347 [Journal]
   
8. Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
   Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:349-373 [Journal]
   
9. Andreas Malcher
   Minimizing finite automata is computationally hard. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:327, n:3, pp:375-390 [Journal]