Subscriber Authentication Point

EDPS Account

Volume 43 / No 2 (April-June 2009)

RAIRO - Theoretical Informatics and Applications

Volume 43 / No 2 (April-June 2009)

Export the citation of the selected articles Export
Select all

Repetitions and permutations of columns in the semijoin algebra p. 179

Dirk Leinders and Jan Van Den Bussche

Published online: 05 June 2008

DOI: https://doi.org/10.1051/ita:2008023

On the power of randomization for job shop scheduling with k-units length tasks p. 189

Tobias Mömke

Published online: 05 June 2008

DOI: https://doi.org/10.1051/ita:2008024

The theorem of Fine and Wilf for relational periods p. 209

Vesa Halava, Tero Harju and Tomi Kärki

Published online: 05 June 2008

DOI: https://doi.org/10.1051/ita:2008025

Minimal NFA and biRFSA Languages p. 221

Michel Latteux, Yves Roos and Alain Terlutte

Published online: 23 May 2008

DOI: https://doi.org/10.1051/ita:2008022

A note on dual approximation algorithms for class constrained bin packing problems p. 239

Eduardo C. Xavier and Flàvio Keidi Miyazawa

Published online: 21 October 2008

DOI: https://doi.org/10.1051/ita:2008027

Thread algebra for noninterference p. 249

Thuy Duong Vu

Published online: 02 October 2008

DOI: https://doi.org/10.1051/ita:2008026

Polynomial languages with finite antidictionaries p. 269

Arseny M. Shur

Published online: 22 November 2008

DOI: https://doi.org/10.1051/ita:2008028

Efficient validation and construction of border arrays and validation of string matching automata p. 281

Jean-Pierre Duval, Thierry Lecroq and Arnaud Lefebvre

Published online: 04 December 2008

DOI: https://doi.org/10.1051/ita:2008030

Directive words of episturmian words: equivalences and normalization p. 299

Amy Glen, Florence Levé and Gwénaël Richomme

Published online: 22 November 2008

DOI: https://doi.org/10.1051/ita:2008029

Tree Automata and Automata on Linear Orderings p. 321

Véronique Bruyère, Olivier Carton and Géraud Sénizergues

Published online: 03 April 2009

DOI: https://doi.org/10.1051/ita/2009009

Highly Undecidable Problems For Infinite Computations p. 339

Olivier Finkel

Published online: 14 February 2009

DOI: https://doi.org/10.1051/ita/2009001

On context-free rewriting with a simple restriction and its computational completeness p. 365

Tomáš Masopust and Alexander Meduna

Published online: 06 March 2009

DOI: https://doi.org/10.1051/ita/2009002

Nested Sibling Tree Automata p. 379

Françoise Gire and Jean-Marc Talbot

Published online: 12 March 2009

DOI: https://doi.org/10.1051/ita/2009006