{"product_id":"automata-on-infinite-words-ecole-de-printemps-dinformatique-theorique-le-mont-dore-may-14-18-1984-von-m-nivat-d-perrin-hrsg","title":"Automata on Infinite Words","description":"\u003cp\u003eAn introduction to finite automata on infinite words.- Deterministic and non ambiguous rational ?-languages.- Ensembles reconnaissables de mots bi-inpinis Limite et d¿rminisme.- 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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783540156413\"\u003e\u003ch3\u003eEcole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9783540156413","offer_id":39426412216413,"sku":"9783540156413","price":53.49,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/d2bf6908-b917-4062-911b-eae43aac4aec.jpg?v=1773553343","url":"https:\/\/shop.autorenwelt.de\/products\/automata-on-infinite-words-ecole-de-printemps-dinformatique-theorique-le-mont-dore-may-14-18-1984-von-m-nivat-d-perrin-hrsg","provider":"Autorenwelt Shop","version":"1.0","type":"link"}