Revues
Séminaires
Livres
Notes de cours
Thèses
Auteurs
OFF
Revues
Séminaires
Livres
Notes de cours
Thèses
Auteurs
Tout
Tout
Auteur
Titre
Bibliographie
Mots clés
Plein texte
Rechercher
NOT
Entre
et
Auteur
Tout
Auteur
Titre
Date
Bibliographie
Mots clés
Plein texte
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Tome 40 (2006)
Sommaire du
Fascicule no. 1
Series which are both max-plus and min-plus rational are unambiguous
Lombardy, Sylvain
;
Mairesse, Jean
p. 1-14
On Christoffel classes
Borel, Jean-Pierre
;
Reutenauer, Christophe
p. 15-27
On a complete set of operations for factorizing codes
Felice, Clelia De
p. 29-52
Theories of orders on the set of words
Kuske, Dietrich
p. 53-74
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
Hemaspaandra, Edith
;
Rothe, Jörg
;
Spakowski, Holger
p. 75-91
Sommaire du
Fascicule no. 2
Preface
Campadelli, Paola
;
Choffrut, Christian
;
Goldwurm, Massimiliano
;
Torelli, Mauro
p. v-xiii
Entropy generation in a model of reversible computation
Falco, Diego de
;
Tamascelli, Dario
p. 93-105
Increasing integer sequences and Goldbach's conjecture
Torelli, Mauro
p. 107-121
Eye localization for face recognition
Campadelli, Paola
;
Lanzarotti, Raffaella
;
Lipori, Giuseppe
p. 123-139
Complexity classes for membrane systems
Porreca, Antonio E.
;
Mauri, Giancarlo
;
Zandron, Claudio
p. 141-162
Characterization of lung tumor subtypes through gene expression cluster validity assessment
Valentini, Giorgio
;
Ruffino, Francesca
p. 163-176
Different time solutions for the firing squad synchronization problem on basic grid networks
Gruska, Jozef
;
Torre, Salvatore La
;
Napoli, Margherita
;
Parente, Mimmo
p. 177-206
Probabilistic models for pattern statistics
Goldwurm, Massimiliano
;
Radicioni, Roberto
p. 207-225
Graph fibrations, graph isomorphism, and pagerank
Boldi, Paolo
;
Lonati, Violetta
;
Santini, Massimo
;
Vigna, Sebastiano
p. 227-253
Decision problems among the main subfamilies of rational relations
Carton, Olivier
;
Choffrut, Christian
;
Grigorieff, Serge
p. 255-275
Unambiguous recognizable two-dimensional languages
Anselmo, Marcella
;
Giammarresi, Dora
;
Madonia, Maria
;
Restivo, Antonio
p. 277-293
On the simplest centralizer of a language
Massazza, Paolo
;
Salmela, Petri
p. 295-301
String distances and intrusion detection : bridging the gap between formal languages and computer security
Bruschi, Danilo
;
Pighizzini, Giovanni
p. 303-313
Quantum finite automata with control language
Mereghetti, Carlo
;
Palano, Beatrice
p. 315-332
A survey on transitivity in discrete time dynamical systems. Application to symbolic systems and related languages
Cattaneo, Gianpiero
;
Dennunzio, Alberto
;
Farina, Fabio
p. 333-352
Towards a theory of practice in metaheuristics design : a machine learning perspective
Birattari, Mauro
;
Zlochin, Mark
;
Dorigo, Marco
p. 353-369
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
Grossi, Giuliano
;
Marchi, Massimo
;
Posenato, Roberto
p. 371-388
A distributed voting scheme to maximize preferences
Auer, Peter
;
Cesa-Bianchi, Nicolò
p. 389-403
Sommaire du
Fascicule no. 3
Foreword
Richomme, Gwénaël
p. 405
Well quasi-orders, unavoidable sets, and derivation systems
D'Alessandro, Flavio
;
Varricchio, Stefano
p. 407-426
A generator of morphisms for infinite words
Ochem, Pascal
p. 427-441
On possible growths of arithmetical complexity
Frid, Anna E.
p. 443-458
Transcendence of numbers with an expansion in a subclass of complexity 2n + 1
Kärki, Tomi
p. 459-471
Squares and overlaps in the Thue-Morse sequence and some variants
Brown, Shandy
;
Rampersad, Narad
;
Shallit, Jeffrey
;
Vasiga, Troy
p. 473-484
Deterministic blow-ups of minimal NFA's
Jirásková, Galina
p. 485-499
Note on the complexity of Las Vegas automata problems
Jirásková, Galina
p. 501-510
A little more about morphic sturmian words
Fagnot, Isabelle
p. 511-518
Sommaire du
Fascicule no. 4
Packing of (0, 1)-matrices
Vialette, Stéphane
p. 519-535
Picture codes
Bozapalidis, Symeon
;
Grammatikopoulou, Archontia
p. 537-550
Undecidability of infinite post correspondence problem for instances of size 9
Halava, Vesa
;
Harju, Tero
p. 551-557
The accessibility of an access structure
Carreras, Francesc
;
Magaña, Antonio
;
Munuera, Carlo
p. 559-567
Sequences of low arithmetical complexity
Avgustinovich, Sergey V.
;
Cassaigne, Julien
;
Frid, Anna E.
p. 569-582
On multiperiodic words
Holub, Štěpán
p. 583-591
Edit distance between unlabeled ordered trees
Micheli, Anne
;
Rossin, Dominique
p. 593-609
Conversion of regular expressions into realtime automata
Geffert, Viliam
;
Ištoňová, L'ubomíra
p. 611-629