default search action
Theoretical Computer Science, Volume 281
Volume 281, Number 1-2, June 2002
- Giorgio Ausiello:
Selected Papers in honour of Maurice Nivat - Editorial. 1 - Pierre-Louis Curien:
Une breve biographie scientifique de Maurice Nivat. 3-23 - Grzegorz Rozenberg, Arto Salomaa:
ICALP, EATCS and Maurice Nivat. 25-30 - André Arnold:
Nivat's processes and their synchronization. 31-36 - Cyril Banderier, Philippe Flajolet:
Basic analytic combinatorics of directed lattice paths. 37-80 - Danièle Beauquier, Jean-Claude Fournier:
Groups and tilings. 81-97 - Jean Berstel, Laurent Vuillon:
Coding rotations on intervals. 99-107 - Gérard Boudol, Ilaria Castellani:
Noninterference for concurrent programs and thread systems. 109-130 - Roberto Bruni, Ugo Montanari:
Dynamic connectors for concurrency. 131-176 - Bruno Courcelle, Teodor Knapik:
The evaluation of first-order substitution is monadic second-order compatible. 177-206 - Guy Cousineau:
Tilings as a programming exercise. 207-217 - Max Dauchet, Sophie Tison, Marc Tommasi:
Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. 219-233 - Alberto Del Lungo:
Reconstructing permutation matrices from diagonal sums. 235-249 - Marianne Delorme, Jacques Mazoyer:
Reconnaissance parallele des langages rationnels sur automates cellulaires plans. 251-289 - Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Counting H-colorings of partial k-trees. 291-309 - Bruno Durand:
De la logique aux pavages. 311-324 - Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Gene assembly through cyclic graph decomposition. 325-349 - Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
An algebraic characterization of the set of succession rules. 351-367 - Paul Gastin, Michael W. Mislove:
A truly concurrent semantics for a process algebra using resource pomsets. 369-421 - Serge Grigorieff:
Modelization of deterministic rational relations. 423-453 - Peter Gritzmann, Sven de Vries:
On the algorithmic inversion of the discrete Radon transform. 455-469 - Mitsuhiro Okada:
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. 471-498 - Teodor Rus:
A unified language processing methodology. 499-536 - Arto Salomaa:
Uni-transitional Watson-Crick D0L systems. 537-553 - Géraud Sénizergues:
L(A)=L(B)? A simplified decidability proof. 555-608 - Gérard P. Huet:
Srl Yantra Geometry. 609-628
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.