Search

• < Previous
• 1
• Next >

Ambiguity of {\omega}-Languages of Turing Machines

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\"uchi acceptance condition, which is also the class {\Sigma}11 of (effective) analytic subsets of&nbsp;[&hellip;]