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
Computer has a single LIFO stack containing ?xed precision unsigned integers (so each integer is subject to over?ow problems) but which has unbounded depth (so the stack itself nev

how to write program Minimum Cost Calculation - Vogel Approximation Method(VAM

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

how many pendulum swings will it take to walk across the classroom?

What is the purpose of GDTR?

All that distinguishes the de?nition of the class of Regular languages from that of the class of Star-Free languages is that the former is closed under Kleene closure while the lat

It is not hard to see that ε-transitions do not add to the accepting power of the model. The underlying idea is that whenever an ID (q, σ  v) directly computes another (p, v) via

Prove that Language is non regular TRailing count={aa ba aaaa abaa baaa bbaa aaaaaa aabaaa abaaaa..... 1) Pumping Lemma 2)Myhill nerode

The Emptiness Problem is the problem of deciding if a given regular language is empty (= ∅). Theorem 4 (Emptiness) The Emptiness Problem for Regular Languages is decidable. P

To see this, note that if there are any cycles in the Myhill graph of A then L(A) will be infinite, since any such cycle can be repeated arbitrarily many times. Conversely, if the