• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
1
0
0

Texte intégral

(1)

RAIRO-Theor. Inf. Appl.42(2008) 415 Available online at:

DOI:10.1051/ita:2008007 www.rairo-ita.org

JM’06 Preface

This special issue of RAIRO-ITA is dedicated to the eleventh Mons Days of Theoretical Computer Science (JM’ 06) held from August 30th to September 1st, 2006 in Rennes, France.

This special issue represents a distinguished subset of the contributions to JM’ 06 reflecting the diversity and the quality of this event. This international meeting gathered 85 participants from 18 countries. The program consisted of 41 scientific talks including 6 synthesis talks of invited speakers.

The topics covered were discrete mathematics and theoretical computer science with an emphasis on combinatorics on words and finite graphs (including algorith- mic and algebraic aspects), all aspects of formal languages and codes, finite and infinite automata (including structural and logical aspects).

This conference has been supported by theAssociation Fran¸caise d’Informatique Fondamentale, the AutoMathaprogram of the European Science Foundation, the City of Rennes, the Foundation Michel M´etivier, the GDR Algorithmique, Lan- gage et Programmation of the CNRS, the Laboratory IRISA, the Minist`ere de l’Enseignement sup´erieur et de la Recherche, the R´egion of Bretagne, and the University of Rennes 1.

Authors of the contributions of this special issue of RAIRO-ITA were invited to submit journal versions of their contributions, which were thoroughly reviewed according to the standards of regular issues of RAIRO-ITA.

We would like to thank all authors for their efforts in preparing journal version of their contributions; we also thank the numerous reviewers for their thorough reports.

The Guest Editors:

Didier Caucal and Anne Siegel

Article published by EDP Sciences c EDP Sciences 2008

Références

Documents relatifs

Topics of the conference were related to several fields of theoretical computer science and discrete mathematics, as for instance: combinatorics and algorithmics on words,

It gives us the same information, but talking about any player: on a large number of players, the average payout per game is –0.5 € AND when the number of games of a player

Interestingly enough, more is known about these seemingly more challenging versions than on the original pancake flipping problems: Caprara [8] proved that sorting unsigned

EPITA — École Pour l’Informatique et les Techniques Avancées. June

EPITA — École Pour l’Informatique et les Techniques Avancées. June

- Pierre Arnoux, Université de la Méditerranée, - Pierre Cartier, École Normale Supérieure de Paris, - Julien Cassaigne, Institut de Mathématiques de Luminy, - Sébastien

By (1) analyzing several characteristics of four types of cross cells and (2) presenting three cycle-merging operations and one extension operation, we propose an algorithm that

In particular, we compute the size of a smallest string attractor for infinite families of words that are well known in the field of Combinatorics on Words: standard Sturmian words