Positiveness problem - decision problems, Theory of Computation

Assignment Help:

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.


Related Discussions:- Positiveness problem - decision problems

Exhaustive search, A problem is said to be unsolvable if no algorithm can s...

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

Alphabets - strings and representation, A finite, nonempty ordered set will...

A finite, nonempty ordered set will be called an alphabet if its elements are symbols, or characters. A finite sequence of symbols from a given alphabet will be called a string ove

Third model of computation, Computer has a single LIFO stack containing ?xe...

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

Concatenation, We saw earlier that LT is not closed under concatenation. If...

We saw earlier that LT is not closed under concatenation. If we think in terms of the LT graphs, recognizing the concatenation of LT languages would seem to require knowing, while

Find regular grammar : a(a+b)*(ab*+ba*)b, Find the Regular Grammar for the ...

Find the Regular Grammar for the following Regular Expression:                    a(a+b)*(ab*+ba*)b.

Closure properties of recognizable languages, We got the class LT by taking...

We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also

Theory of computation, Computations are deliberate for processing informati...

Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of

Non-determinism - recognizable language, Our DFAs are required to have exac...

Our DFAs are required to have exactly one edge incident from each state for each input symbol so there is a unique next state for every current state and input symbol. Thus, the ne

Differentiate between dfa and nfa, Differentiate between DFA and NFA. Conve...

Differentiate between DFA and NFA. Convert the following Regular Expression into DFA. (0+1)*(01*+10*)*(0+1)*. Also write a regular grammar for this DFA.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd