product iamge

Automata on Infinite Words: Ecole de Printemps d'Informatique Théorique Le Mont Dore, May 14–18, 1984

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Dominique Perrin (auth.), M. Nivat, D. Perrin (eds.)
Series: Lecture Notes in Computer Science 192
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1985

Language: English-French
Pages: 222
Tags: Mathematical Logic and Formal Languages

An introduction to finite automata on infinite words....Pages 1-17
Deterministic and non ambiguous rational ω-languages....Pages 18-27
Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme....Pages 28-46
Automates boustrophedon sur des mots infinis....Pages 47-54
Star-free ω-languages and first order logic....Pages 55-67
A formal proof system for infinitary rational expressions....Pages 68-80
Logical formulas and four subclasses of ω-regular languages....Pages 81-88
Deterministic asynchronous automata....Pages 89-98
Alternating automata on infinite objects, determinacy and Rabin's theorem....Pages 99-107
The solution of two star-height problems for regular trees....Pages 108-117
Decidability of yield's equality for infinite regular trees....Pages 118-136
Languages and subshifts....Pages 137-146
The adherences of languages as topological spaces....Pages 147-163
Mots infinis en arithmetique....Pages 164-171
Kth power-free codes....Pages 172-187
On various classes of infinite words obtained by iterated mappings....Pages 188-197
Overlap free words on two symbols....Pages 198-206
Overlap-free sequences....Pages 207-215