RAIRO-Theor. Inf. Appl.
Volume 43, Number 2, April-June 2009
|Page(s)||339 - 364|
|Published online||14 February 2009|
Highly Undecidable Problems For Infinite Computations
Equipe de Logique Mathématique, CNRS et Université Paris 7, France; firstname.lastname@example.org
Accepted: 13 November 2008
We show that many classical decision problems about 1-counter ω-languages, context free ω-languages, or infinitary rational relations, are Π½ -complete, hence located at the second level of the analytical hierarchy, and “highly undecidable”. In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and the unambiguity problem are all Π½ -complete for context-free ω-languages or for infinitary rational relations. Topological and arithmetical properties of 1-counter ω-languages, context free ω-languages, or infinitary rational relations, are also highly undecidable. These very surprising results provide the first examples of highly undecidable problems about the behaviour of very simple finite machines like 1-counter automata or 2-tape automata.
Mathematics Subject Classification: 68Q05 / 68Q45 / 03D05
Key words: Infinite computations / 1-counter-automata / 2-tape automata / decision problems / arithmetical hierarchy / analytical hierarchy / complete sets / highly undecidable problems.
© EDP Sciences, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.