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
If the first three words are the boys down,what are the last three words??

Given any NFA A, we will construct a regular expression denoting L(A) by means of an expression graph, a generalization of NFA transition graphs in which the edges are labeled with

Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}




Sketch an algorithm for the universal recognition problem for SL 2 . This takes an automaton and a string and returns TRUE if the string is accepted by the automaton, FALSE otherwi

Application of the general suffix substitution closure theorem is slightly more complicated than application of the specific k-local versions. In the specific versions, all we had

The Recognition Problem for a class of languages is the question of whether a given string is a member of a given language. An instance consists of a string and a (?nite) speci?cat

A problem is said to be unsolvable if no algorithm can solve it. The problem is said to be undecidable if it is a decision problem and no algorithm can decide it. It should be note