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
The objective of the remainder of this assignment is to get you thinking about the problem of recognizing strings given various restrictions to your model of computation. We will w

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

Computer has a single unbounded precision counter which you can only increment, decrement and test for zero. (You may assume that it is initially zero or you may include an explici

We represented SLk automata as Myhill graphs, directed graphs in which the nodes were labeled with (k-1)-factors of alphabet symbols (along with a node labeled ‘?' and one labeled

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

Applying the pumping lemma is not fundamentally di?erent than applying (general) su?x substitution closure or the non-counting property. The pumping lemma is a little more complica

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

We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

One of the first issues to resolve, when exploring any mechanism for defining languages is the question of how to go about constructing instances of the mechanism which define part

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?