Automata on Infinite Words 1984: Le Mont Dore, France

The Theory of Büchi and McNaughton

• Dominique Perrin:
  An introduction to finite automata on infinite words. 2-17
  
• André Arnold:
  Deterministic and non ambiguous rational omega-languages. 18-27
  
• Danièle Beauquier:
  Ensembles reconnaissables de mots bi -infinis limite et déterminisme. 28-46
  
• Jean-Pierre Pécuchet:
  Automates boustrophédon sur des mots infinis. 47-54
  

Logic and Automata

• Jean-Eric Pin:
  Star free omega-languages and first order logic. 56-67
  
• Philippe Darondeau, Laurent Kott:
  A formal proof system for infinitary rational expressions. 68-80
  
• Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki:
  Logical formulas and four subclasses of omega-regular languages. 81-88
  
• M. W. Shields:
  Deterministic asynchronous automata. 89-98
  

Automata on infinite trees

• David E. Muller, Paul E. Schupp:
  Alternating automata on infinite objects, determinacy and Rabin's theorem. 100-107
  
• Jean-Pierre Braquelaire, Bruno Courcelle:
  The solution of two star height problems for regular trees. 108-117
  
• Max Dauchet, Erick Timmerman:
  Decidability of yield's equality for infinite regular trees. 118-136
  

Topological aspects of automata on infinite words

• François Blanchard, Georges Hansel:
  Languages and subshifts. 138-146
  
• Tom Head:
  The adherences of languages as topological spaces. 147-163
  

Iterated morphisms and infinite words

• G. Rauzy:
  Mots infinis en arithmétique. 165-171
  
• Michel Leconte:
  K-th power free codes. 172-187
  
• Jean-Jacques Pansiot:
  On various classes of infinite words obtained by iterated mappings. 188-197
  
• Antonio Restivo, Sergio Salemi:
  Overlap-free words on two symbols. 198-206
  
• Patrice Séébold:
  Overlap-free sequences. 207-215