The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2007, volume: 376, number: 1-2

  1. Oscar H. Ibarra
    Developments in language theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:1-2 [Journal]
  2. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Events and modules in reaction systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:3-16 [Journal]
  3. Yuri Gurevich, Margus Veanes, Charles Wallace
    Can abstract state machines be useful in language theory? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:17-29 [Journal]
  4. Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks
    Synchronizing automata with a letter of deficiency 2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:30-41 [Journal]
  5. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Equivalence of simple functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:42-51 [Journal]
  6. Olivier Carton
    The growth ratio of synchronous rational relations is unique. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:52-59 [Journal]
  7. Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu
    On the existence of prime decompositions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:60-69 [Journal]
  8. Dalia Krieger
    On critical exponents in fixed points of non-erasing morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:70-88 [Journal]
  9. Manfred Kufleitner
    Polynomials, fragments of temporal logic and the variety DA over traces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:89-100 [Journal]
  10. Martin Kutrib, Andreas Malcher
    Context-dependent nondeterminism for pushdown automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:101-111 [Journal]
  11. Alexander Okhotin, Oksana Yakimova
    Language equations with complementation: Decision problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:112-126 [Journal]
  12. Bala Ravikumar
    On some variations of two-way probabilistic finite automata models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:127-136 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002