The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These notions are closely connected. In this paper we consider regular realizability problems for languages consist- ing of all prefixes of an infinite word. These problems are related to the automata on infinite words and to the decidability of monadicarXiv:1105.5894v1 fatcat:u47uvpqdq5f2jhhnwtwvfhowbq