Journals in DBLP
Professor Choffrut. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:- [Journal ] Alberto Bertoni , Zoltán Ésik , Juhani Karhumäki Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:1-5 [Journal ] Marie-Pierre Béal , Dominique Perrin Codes, unambiguous automata and sofic systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:6-13 [Journal ] Alberto Bertoni , Carlo Mereghetti , Beatrice Palano Some formal tools for analyzing quantum automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:14-25 [Journal ] Robert Brijder , Hendrik Jan Hoogeboom , Grzegorz Rozenberg Reducibility of gene patterns in ciliates using the breakpoint graph. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:26-45 [Journal ] Janusz A. Brzozowski Representation of a class of nondeterministic semiautomata by canonical words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:46-57 [Journal ] Giusi Castiglione , Antonio Restivo , Roberto Vaglica A reconstruction algorithm for L-convex polyominoes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:58-72 [Journal ] Laura Chaubard , Jean-Eric Pin , Howard Straubing Actions, wreath products of C -varieties and concatenation product. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:73-89 [Journal ] Alessandra Cherubini , Stefano Crespi-Reghizzi , Matteo Pradella , Pierluigi San Pietro Picture languages: Tiling systems versus tile rewriting grammars. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:90-103 [Journal ] Flavio D'Alessandro , Benedetto Intrigila , Stefano Varricchio On the structure of the counting function of sparse context-free languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:104-117 [Journal ] Aldo de Luca , Alessandro De Luca Some characterizations of finite Sturmian words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:118-125 [Journal ] Volker Diekert , Paul Gastin From local to global temporal logics over Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:126-135 [Journal ] Zoltán Ésik Characterizing CTL-like logics on finite trees. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:136-152 [Journal ] Massimiliano Goldwurm , Violetta Lonati Pattern statistics and Vandermonde matrices. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:153-169 [Journal ] Serge Grigorieff Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(logm D ). [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:170-185 [Journal ] Tero Harju , Dirk Nowotka On unique factorizations of primitive words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:186-189 [Journal ] Oscar H. Ibarra , Bala Ravikumar On partially blind multihead finite automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:190-199 [Journal ] Juhani Karhumäki , Michal Kunc , Alexander Okhotin Computing by commuting. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:200-211 [Journal ] Michel Latteux , Aurélien Lemay , Yves Roos , Alain Terlutte Identification of biRFSA languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:212-223 [Journal ] Sylvain Lombardy , Jacques Sakarovitch Sequential? [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:224-244 [Journal ] Jean Neraud Completing prefix codes in submonoids. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:245-254 [Journal ] Wieslaw Zielonka Time-stamps for Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:255-262 [Journal ]