Abstract
The usual notions of acceptance of automata acting on infinite strings yield sets that are in very low Borel classes. In response to a question by Landweber, Wiśniewski introduced the notion of generalized automata that yield sets at any specified level of the Borel hierachy. Here we show that most of Wiśniewski’s results can be easily derieved (and generalized) using the theory of positive analytical operations and δ – s operations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
