Computer Science – Logic in Computer Science
Scientific paper
2008-03-12
RAIRO-Theoretical Informatics and Applications 37 (2) (2003) 105-113
Computer Science
Logic in Computer Science
Scientific paper
We prove in this paper that there exists some infinitary rational relations
which are analytic but non Borel sets, giving an answer to a question of
Simonnet [Automates et Th\'eorie Descriptive, Ph. D. Thesis, Universit\'e Paris
7, March 1992].
No associations
LandOfFree
On the Topological Complexity of Infinitary Rational Relations 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 On the Topological Complexity of Infinitary Rational Relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Topological Complexity of Infinitary Rational Relations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-69238