Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Tome 39 (2005)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Preface
Choffrut, Christian
;
Wakabayashi, Yoshiko
p. i-vii
The globals of pseudovarieties of ordered semigroups containing
B
2
and an application to a problem proposed by Pin
Almeida, Jorge
;
Escada, Ana P.
p. 1-29
The pseudovariety of semigroups of triangular matrices over a finite field
Almeida, Jorge
;
Margolis, Stuart W.
;
Volkov, Mikhail V.
p. 31-48
Hereditary properties of words
Balogh, József
;
Bollobás, Béla
p. 49-65
Gate circuits in the algebra of transients
Brzozowski, Janusz
;
Gheorghiu, Mihaela
p. 67-91
On the number of dissimilar pfaffian orientations of graphs
de Carvalho, Marcelo H.
;
Lucchesi, Cláudio L.
;
Murty, U. S. R.
p. 93-113
Similarity relations and cover automata
Champarnaud, Jean-Marc
;
Guingne, Franck
;
Hansel, Georges
p. 115-123
Some decision problems on integer matrices
Choffrut, Christian
;
Karhumäki, Juhani
p. 125-131
Finding
H
-partitions efficiently
Dantas, Simone
;
de Figueiredo, Celina M. H.
;
Gravier, Sylvain
;
Klein, Sulamita
p. 133-144
The perfection and recognition of bull-reducible Berge graphs
Everett, Hazel
;
de Figueiredo, Celina M. H.
;
Klein, Sulamita
;
Reed, Bruce
p. 145-160
Some decompositions of Bernoulli sets and codes
Luca, Aldo de
p. 161-174
A sparse dynamic programming algorithm for alignment with non-overlapping inversions
Do Lago, Alair Pereira
;
Muchnik, Ilya
;
Kulikowski, Casimir
p. 175-190
A note on the Size-Ramsey number of long subdivisions of graphs
Donadelli, Jair
;
Haxell, Penny E.
;
Kohayakawa, Yoshiharu
p. 191-206
Episturmian morphisms and a Galois theorem on continued fractions
Justin, Jacques
p. 207-215
How expressions can code for automata
Lombardy, Sylvain
;
Sakarovitch, Jacques
p. 217-237
Some results on
𝒞
-varieties
Pin, Jean-Éric
;
Straubing, Howard
p. 239-262
Parity codes
Pinto, Paulo E. D.
;
Protti, Fábio
;
Szwarcfiter, Jayme L.
p. 263-278
Krohn-Rhodes complexity pseudovarieties are not finitely based
Rhodes, John
;
Steinberg, Benjamin
p. 279-296
Imre Simon : an exceptional graduate student
Thérien, Denis
p. 297-304
Algebraic and graph-theoretic properties of infinite
n
-posets
Ésik, Zoltán
;
Németh, Zoltán L.
p. 305-322
Sommaire du
Fascicule no. 2
Hierarchies of weakly monotone restarting automata
Mráz, František
;
Otto, Friedrich
p. 325-342
Integers with a maximal number of Fibonacci representations
Kocábová, Petra
;
Masáková, Zuzana
;
Pelantová, Edita
p. 343-359
A metric for evaluating software architecture and communication models consistency
Lafaye, Jean-Yves
;
Louis, Georges
p. 361-390
Complexity results for prefix grammars
Lohrey, Markus
;
Petersen, Holger
p. 391-401
Efficient simulation of synchronous systems by multi-speed systems
Jurdziński, Tomasz
;
Kutyłowski, Mirosław
;
Zatopiański, Jan
p. 403-419
Sommaire du
Fascicule no. 3
Foreword
Walukiewicz, I.
p. 421-422
Denotational aspects of untyped normalization by evaluation
Filinski, Andrzej
;
Rohde, Henning Korsholm
p. 423-453
Distance desert automata and the star height problem
Kirsten, Daniel
p. 455-509
Adhesive and quasiadhesive categories
Lack, Stephen
;
Sobociński, Paweł
p. 511-545
Polynomials over the reals in proofs of termination : from theory to practice
Lucas, Salvador
p. 547-586
Bisimulation on speed : lower time bounds
Lüttgen, Gerald
;
Vogler, Walter
p. 587-618
Sommaire du
Fascicule no. 4
The entropy of Łukasiewicz-languages
Staiger, Ludwig
p. 621-639
Languages of finite words occurring infinitely many times in an infinite word
Thomsen, Klaus
p. 641-650
Note sur les relations entre les racines d'un polynôme réductible
Orange, Sébastien
;
Renault, Guenaël
;
Valibouze, Annick
p. 651-659
Equality sets for recursively enumerable languages
Halava, Vesa
;
Harju, Tero
;
Hoogeboom, Hendrik Jan
;
Latteux, Michel
p. 661-675
On maximal QROBDD's of boolean functions
Michon, Jean-Francis
;
Yunès, Jean-Baptiste
;
Valarcher, Pierre
p. 677-686
One-way communication complexity of symmetric boolean functions
Arpe, Jan
;
Jakoby, Andreas
;
Liśkiewicz, Maciej
p. 687-706