Journals in DBLP

Theor. Comput. Sci.
2005, volume: 330, number: 2

1. Henning Bordihn
   On the number of components in cooperating distributed grammar systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:195-204 [Journal]
   
2. Juan Castellanos, Peter Leupold, Victor Mitrana
   On the size complexity of hybrid networks of evolutionary processors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:205-220 [Journal]
   
3. Jean-Marc Champarnaud, Thomas Paranthoën
   Random generation of DFAs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:221-235 [Journal]
   
4. Mark Daley, Ian McQuillan
   Template-guided DNA recombination. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:237-250 [Journal]
   
5. Rudolf Freund, Lila Kari, Marion Oswald, Petr Sosík
   Computationally universal P systems without priorities: two catalysts are sufficient. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:251-266 [Journal]
   
6. Markus Holzer, Martin Kutrib
   On the descriptional complexity of finite automata with modified acceptance conditions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:267-285 [Journal]
   
7. Galina Jirásková
   State complexity of some operations on binary regular languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:287-298 [Journal]
   
8. Martin Kappes, Frank Nießner
   Succinct representations of languages by DFA with different levels of reliability. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:299-310 [Journal]
   
9. Martin Kutrib
   On the descriptional power of heads, counters, and pebbles. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:330, n:2, pp:311-324 [Journal]
   
10. Andreas Malcher
    On two-way communication in cellular automata with a fixed number of cells. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:325-338 [Journal]
    
11. Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan
    Context-free insertion-deletion systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:339-348 [Journal]
    
12. Filippo Mera, Giovanni Pighizzini
    Complementing unary nondeterministic automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:349-360 [Journal]
    
13. György Vaszil
    On the descriptional complexity of some rewriting mechanisms regulated by context conditions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:361-373 [Journal]