|
Journals in DBLP
- Roberto Gorrieri, Fabio Martinelli
Theoretical foundations of security analysis and design II. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:1-2 [Journal]
- Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
Measuring the confinement of probabilistic systems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:3-56 [Journal]
- Jonathan Herzog
A computational interpretation of Dolev-Yao adversaries. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:57-81 [Journal]
- Gordon Thomas Rohrmair, Gavin Lowe
Using data-independence in the analysis of intrusion detection systems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:82-101 [Journal]
- Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon
A semantics for web services authentication. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:102-153 [Journal]
- Roberto Zunino, Pierpaolo Degano
Weakening the perfect encryption assumption in Dolev-Yao adversaries. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:154-178 [Journal]
- Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg
Preface. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:179-185 [Journal]
From Antonio's former students. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:186-187 [Journal]
- Arto Salomaa
Connections between subwords and certain matrix mappings. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:188-203 [Journal]
- Isabel M. Araújo, Véronique Bruyère
Words derivated from Sturmian words. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:204-219 [Journal]
- Arturo Carpi, Aldo de Luca
Codes of central Sturmian words. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:220-239 [Journal]
- Clelia de Felice
An enhanced property of factorizing codes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:240-256 [Journal]
- Stefano Crespi-Reghizzi, Matteo Pradella
Tile rewriting grammars and picture languages. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:257-272 [Journal]
- Tero Harju, Dirk Nowotka
Counting bordered and primitive words with a fixed weight. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:273-279 [Journal]
- Jean Berstel
Growth of repetition-free words -- a review. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:280-290 [Journal]
- Zoltán Ésik, Pascal Weil
Algebraic recognizability of regular tree languages. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:291-321 [Journal]
- Juhani Karhumäki, Michel Latteux, Ion Petre
Commutation with codes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:322-333 [Journal]
- Jean-Pierre Borel, Christophe Reutenauer
Palindromic factors of billiard words. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:334-348 [Journal]
- Paola Bonizzoni, Giancarlo Mauri
Regular splicing languages and subclasses. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:349-363 [Journal]
- Christian Choffrut, Berke Durak
Collage of two-dimensional words. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:364-380 [Journal]
- Marie-Pierre Béal, Dominique Perrin
Codes and sofic constraints. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:381-393 [Journal]
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Small size quantum automata recognizing some regular languages. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:394-407 [Journal]
- Marcella Anselmo, Dora Giammarresi, Maria Madonia
New operations and regular expressions for two-dimensional languages over one-letter alphabet. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:408-431 [Journal]
- Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone
Parsing with a finite dictionary. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:432-442 [Journal]
- Jean-Eric Pin, Pedro V. Silva
A topological approach to transductions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:443-456 [Journal]
|