Regular realizability problems and models of a generalized nondeterminism

Details Regular realizability problems and models of a generalized nondeterminism Regular realizability problems and models of a generalized nondeterminism

2011-05-30

arxiv.org/abs/1105.5894v1

Computer Science

Formal Languages and Automata Theory

13 pages

Scientific paper

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 monadic second-order theories. The main contribution is a new decidability condition for regular realizability problems and for monadic-second order theories. We also show that decidability of a regular realizability problem is equivalent to decidability of some prefix realizability problem.

Affiliated with

Also associated with

No associations

Rating

Regular realizability problems and models of a generalized nondeterminism 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 Regular realizability problems and models of a generalized nondeterminism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regular realizability problems and models of a generalized nondeterminism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-677878