Ambiguity of $\omega$-Languages of Turing Machines

Abstract : An omega-language is a set of infinite words over a finite alphabet X. We consider the class of recursive $\omega$-languages, i.e. the class of $\omega$-languages accepted by Turing machines with a Büchi acceptance condition, which is also the class $\Sigma_1^1$ of (effective) analytic subsets of $X^\omega$ for some finite alphabet X. We investigate here the notion of ambiguity for recursive $\omega$-languages with regard to acceptance by Büchi Turing machines. We first present in detail essentials on the literature on $\omega$-languages accepted by Turing Machines. Then we give a complete and broad view on the notion of ambiguity and unambiguity of Büchi Turing machines and of the omega-languages they accept. To obtain our new results, we make use of results and methods of effective descriptive set theory.
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download
Contributor : Olivier Finkel <>
Submitted on : Thursday, October 23, 2014 - 10:51:19 AM
Last modification on : Thursday, April 4, 2019 - 1:32:54 AM
Document(s) archivé(s) le : Saturday, January 24, 2015 - 10:12:03 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00735050, version 2


Olivier Finkel. Ambiguity of $\omega$-Languages of Turing Machines. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2014, 10 (3:12), pp.1-18. ⟨hal-00735050v2⟩



Record views


Files downloads