Computer Science – Logic in Computer Science
Scientific paper
2009-01-04
RAIRO - Theoretical Informatics and Applications 43, 2 (2009) 339-364
Computer Science
Logic in Computer Science
to appear in RAIRO-Theoretical Informatics and Applications
Scientific paper
We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-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 $\Pi_2^1$-complete for context-free omega-languages or for infinitary rational relations. Topological and arithmetical properties of 1-counter omega-languages, context free omega-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.
No associations
LandOfFree
Highly Undecidable Problems For Infinite Computations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Highly Undecidable Problems For Infinite Computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Highly Undecidable Problems For Infinite Computations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-456496