Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]