- 2005
- Jorge Almeida
, Ana Paula Escada:
The globals of pseudovarieties of ordered semigroups containing B2 and an application to a problem proposed by Pin. RAIRO Theor. Informatics Appl. 39(1): 1-29 (2005) - Jorge Almeida, Stuart W. Margolis, Mikhail V. Volkov:
The pseudovariety of semigroups of triangular matrices over a finite field. RAIRO Theor. Informatics Appl. 39(1): 31-48 (2005) - Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-way communication complexity of symmetric Boolean functions. RAIRO Theor. Informatics Appl. 39(4): 687-706 (2005) - József Balogh, Béla Bollobás:
Hereditary properties of words. RAIRO Theor. Informatics Appl. 39(1): 49-65 (2005) - Janusz A. Brzozowski, Mihaela Gheorghiu:
Gate circuits in the algebra of transients. RAIRO Theor. Informatics Appl. 39(1): 67-91 (2005) - Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
On the number of dissimilar pfaffian orientations of graphs. RAIRO Theor. Informatics Appl. 39(1): 93-113 (2005) - Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Similarity relations and cover automata. RAIRO Theor. Informatics Appl. 39(1): 115-123 (2005) - Christian Choffrut, Juhani Karhumäki:
Some decision problems on integer matrices. RAIRO Theor. Informatics Appl. 39(1): 125-131 (2005) - Christian Choffrut, Yoshiko Wakabayashi:
Preface. RAIRO Theor. Informatics Appl. 39(1) (2005) - Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein:
Finding H-partitions efficiently. RAIRO Theor. Informatics Appl. 39(1): 133-144 (2005) - Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa:
A note on the Size-Ramsey number of long subdivisions of graphs. RAIRO Theor. Informatics Appl. 39(1): 191-206 (2005) - Zoltán Ésik, Zoltán L. Németh:
Algebraic and graph-theoretic properties of infinite n-posets. RAIRO Theor. Informatics Appl. 39(1): 305-322 (2005) - Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
The perfection and recognition of bull-reducible Berge graphs. RAIRO Theor. Informatics Appl. 39(1): 145-160 (2005) - Andrzej Filinski, Henning Korsholm Rohde:
Denotational aspects of untyped normalization by evaluation. RAIRO Theor. Informatics Appl. 39(3): 423-453 (2005) - Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Equality sets for recursively enumerable languages. RAIRO Theor. Informatics Appl. 39(4): 661-675 (2005) - Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Efficient simulation of synchronous systems by multi-speed systems. RAIRO Theor. Informatics Appl. 39(2): 403-419 (2005) - Jacques Justin:
Episturmian morphisms and a Galois theorem on continued fractions. RAIRO Theor. Informatics Appl. 39(1): 207-215 (2005) - Daniel Kirsten:
Distance desert automata and the star height problem. RAIRO Theor. Informatics Appl. 39(3): 455-509 (2005) - Petra Kocábová, Zuzana Masáková, Edita Pelantová:
Integers with a maximal number of Fibonacci representations. RAIRO Theor. Informatics Appl. 39(2): 343-359 (2005) - Stephen Lack, Pawel Sobocinski:
Adhesive and quasiadhesive categories. RAIRO Theor. Informatics Appl. 39(3): 511-545 (2005) - Jean-Yves Lafaye, Georges Louis:
A metric for evaluating software architecture and communication models consistency. RAIRO Theor. Informatics Appl. 39(2): 361-390 (2005) - Alair Pereira do Lago, Ilya B. Muchnik, Casimir A. Kulikowski:
A sparse dynamic programming algorithm for alignment with non-overlapping inversions. RAIRO Theor. Informatics Appl. 39(1): 175-189 (2005) - Markus Lohrey, Holger Petersen:
Complexity results for prefix grammars. RAIRO Theor. Informatics Appl. 39(2): 391-401 (2005) - Sylvain Lombardy, Jacques Sakarovitch:
How expressions can code for automata. RAIRO Theor. Informatics Appl. 39(1): 217-237 (2005) - Aldo de Luca:
Some decompositions of Bernoulli sets and codes. RAIRO Theor. Informatics Appl. 39(1): 161-174 (2005) - Salvador Lucas:
Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theor. Informatics Appl. 39(3): 547-586 (2005) - Gerald Lüttgen, Walter Vogler:
Bisimulation on speed: Lower time bounds. RAIRO Theor. Informatics Appl. 39(3): 587-618 (2005) - Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher:
On maximal QROBDD's of Boolean functions. RAIRO Theor. Informatics Appl. 39(4): 677-686 (2005) - Frantisek Mráz, Friedrich Otto:
Hierarchies of weakly monotone restarting automata. RAIRO Theor. Informatics Appl. 39(2): 325-342 (2005) - Sébastien Orange, Guénaël Renault, Annick Valibouze:
Note sur les relations entre les racines d'un polynéme réductible (Text in French). RAIRO Theor. Informatics Appl. 39(4): 651-659 (2005)
