Positiveness problem - decision problems, Theory of Computation

For example, the question of whether a given regular language is positive (does not include the empty string) is algorithmically decidable.

"Positiveness Problem".

Note that each instance of the Positiveness Problem is a regular language. (Each instance itself is, not the set of solved instances.) Clearly, we cannot take the set of strings in the language to be our instance, (since, in general, this is likely to be in?nite in size. But we have at least two means of specifying any regular language using ?nite objects: we can give a Finite State Automaton that recognizes the language as a ?ve-tuple, each component of which is ?nite, (or, equivalently, the transition graph in some other form) or we can give a regular expression. Since we have algorithms for converting back and forth between these two forms, we can choose whichever is convenient for us. In this case, lets assume we are given the ?ve-tuple. Since we have an algorithm for converting NFAs to DFAs as well, we can also assume, without loss of generality, that the automaton is a DFA.

A solution to the Positiveness Problem is just "True" or "False". It is a decision problem a problem of deciding whether the given instance exhibits a particular property. (We are familiar with this sort of problem. They are just our "checking problems"-all our automata are models of algorithms for decision problems.) So the Positiveness Problem, then, is just the problem of identifying the set of Finite State Automata that do not accept the empty string. Note that we are not asking if this set is regular, although we could. (What do you think the answer would be?) We are asking if there is any algorithm at all for solving it.

Posted Date: 3/21/2013 1:47:59 AM | Location : United States







Related Discussions:- Positiveness problem - decision problems, Assignment Help, Ask Question on Positiveness problem - decision problems, Get Answer, Expert's Help, Positiveness problem - decision problems Discussions

Write discussion on Positiveness problem - decision problems
Your posts are moderated
Related Questions

Can you say that B is decidable? If you somehow know that A is decidable, what can you say about B?


When we say "solved algorithmically" we are not asking about a speci?c programming language, in fact one of the theorems in computability is that essentially all reasonable program

#Your company has 25 licenses for a computer program, but you discover that it has been copied onto 80 computers. You informed your supervisor, but he/she is not willing to take an

The fact that the Recognition Problem is decidable gives us another algorithm for deciding Emptiness. The pumping lemma tells us that if every string x ∈ L(A) which has length grea

Another way of representing a strictly 2-local automaton is with a Myhill graph. These are directed graphs in which the vertices are labeled with symbols from the input alphabet of

In general non-determinism, by introducing a degree of parallelism, may increase the accepting power of a model of computation. But if we subject NFAs to the same sort of analysis

We developed the idea of FSA by generalizing LTk transition graphs. Not surprisingly, then, every LTk transition graph is also the transition graph of a FSA (in fact a DFA)-the one

how to prove he extended transition function is derived from part 2 and 3