Beauquier, D. Ensembles reconnaissables de mots bi-infinis. Limite et déterminisme. (French) Zbl 0613.68031 Automata on infinite words, Ec. Printemps Inf. Théor. Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 28-46 (1985). Reviewer: G.Orman MSC: 68Q45 PDF BibTeX XML
Rauzy, G. Mots infinis en arithmétique. (Infinite words in arithmetic). (French) Zbl 0613.10044 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 165-171 (1985). Reviewer: F.Schweiger MSC: 11B99 94B99 03D40 PDF BibTeX XML
Arnold, André Deterministic and non ambiguous rational \(\omega\)-languages. (English) Zbl 0612.68073 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 18-27 (1985). Reviewer: G.Orman MSC: 68Q45 PDF BibTeX XML
Muller, David; Schupp, Paul E. Alternating automata on infinite objects, determinacy and Rabin’s theorem. (English) Zbl 0608.03004 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 100-107 (1985). MSC: 03B25 03E60 03D05 91A07 PDF BibTeX XML
Perrin, Dominique An introduction to finite automata on infinite words. (English) Zbl 0604.68091 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 2-17 (1985). Reviewer: G.Păun MSC: 68Q45 03D05 68-01 03-01 PDF BibTeX XML
Pin, J. E. Star-free \(\omega\)-languages and first order logic. (English) Zbl 0578.68056 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 56-67 (1985). Reviewer: C.Masalagiu MSC: 68Q45 03B20 PDF BibTeX XML
Darondeau, Ph.; Kott, L. A formal proof system for infinitary rational expressions. (English) Zbl 0575.68083 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 68-80 (1985). Reviewer: C.Masalagiu MSC: 68Q45 03D05 68Q65 03B25 PDF BibTeX XML
Kobayashi, K.; Takahashi, Masako; Yamasaki, H. Logical formulas and four subclasses of \(\omega\)-regular languages. (English) Zbl 0575.03029 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 81-88 (1985). MSC: 03D05 03B15 68Q45 03B10 PDF BibTeX XML
Braquelaire, J. P.; Courcelle, B. The solution of two star-height problems for regular trees. (English) Zbl 0574.68052 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 108-117 (1985). MSC: 68Q45 68R10 05C05 PDF BibTeX XML
Séébold, Patrice Overlap-free sequences. (English) Zbl 0572.20039 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 207-215 (1985). Reviewer: T.J.Harju MSC: 20M05 68Q45 PDF BibTeX XML
Restivo, Antonio; Salemi, Sergio Overlap free words on two symbols. (English) Zbl 0572.20038 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 198-206 (1985). Reviewer: T.J.Harju MSC: 20M05 68Q45 PDF BibTeX XML
Pecuchet, J. P. Automates boustrophédon sur des mots infinis. (French) Zbl 0571.68075 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 47-54 (1985). MSC: 68Q45 PDF BibTeX XML
Dauchet, Max; Timmerman, Erick Decidability of yield’s equality for infinite regular trees. (English) Zbl 0571.68067 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 118-136 (1985). MSC: 68Q45 PDF BibTeX XML
Pansiot, Jean-Jacques On various classes of infinite words obtained by iterated mappings. (English) Zbl 0571.68065 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 188-197 (1985). MSC: 68Q45 PDF BibTeX XML
Blanchard, F.; Hansel, G. Languages and subshifts. (English) Zbl 0571.68059 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 138-146 (1985). MSC: 68Q45 PDF BibTeX XML
Head, Tom The adherences of languages as topological spaces. (English) Zbl 0571.68057 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 147-163 (1985). MSC: 68Q45 54H99 54A05 PDF BibTeX XML
Leconte, Michel kth power-free codes. (English) Zbl 0571.68054 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 172-187 (1985). MSC: 68Q45 PDF BibTeX XML
Shields, M. W. Deterministic asynchronous automata. (English) Zbl 0571.68040 Automata on infinite words, Ec. Printemps Inf. Théor., Le Mont Dore 1984, Lect. Notes Comput. Sci. 192, 89-98 (1985). MSC: 68Q45 PDF BibTeX XML