Automata on Infinite Words [electronic resource] : Ecole de Printemps d'Informatique Théorique Le Mont Dore, May 14–18, 1984 / edited by M. Nivat, D. Perrin.

Contributor(s): Nivat, M [editor.] | Perrin, D [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 192Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1985Description: X, 222 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540395058Subject(s): Computer science | Computer Science | Mathematical Logic and Formal LanguagesAdditional physical formats: Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-QA10.3Online resources: Click here to access online
Contents:
An introduction to finite automata on infinite words -- Deterministic and non ambiguous rational ?-languages -- Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme -- Automates boustrophedon sur des mots infinis -- Star-free ?-languages and first order logic -- A formal proof system for infinitary rational expressions -- Logical formulas and four subclasses of ?-regular languages -- Deterministic asynchronous automata -- Alternating automata on infinite objects, determinacy and Rabin's theorem -- The solution of two star-height problems for regular trees -- Decidability of yield's equality for infinite regular trees -- Languages and subshifts -- The adherences of languages as topological spaces -- Mots infinis en arithmetique -- Kth power-free codes -- On various classes of infinite words obtained by iterated mappings -- Overlap free words on two symbols -- Overlap-free sequences.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4656

An introduction to finite automata on infinite words -- Deterministic and non ambiguous rational ?-languages -- Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme -- Automates boustrophedon sur des mots infinis -- Star-free ?-languages and first order logic -- A formal proof system for infinitary rational expressions -- Logical formulas and four subclasses of ?-regular languages -- Deterministic asynchronous automata -- Alternating automata on infinite objects, determinacy and Rabin's theorem -- The solution of two star-height problems for regular trees -- Decidability of yield's equality for infinite regular trees -- Languages and subshifts -- The adherences of languages as topological spaces -- Mots infinis en arithmetique -- Kth power-free codes -- On various classes of infinite words obtained by iterated mappings -- Overlap free words on two symbols -- Overlap-free sequences.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha