Equivalence of nfas and dfas, Theory of Computation

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 as we have used in de?ning DFAs we shall see that to simulate an NFA one needs only track ?nitely much information about each string. Consider, again, the example in which we modeled the computation of the NFA as a set of automata processing the input synchronously. In order to determine if a string w is accepted by the NFA all we need to do is to track, at each stage of the computation (i.e., at each pre?x of the input), the states of those automata. Since there is never any reason to include more than one automaton for each state, this will just be some subset of Q-in fact, it is easy to see that the set of states after processing w will be just ˆ δ(q0,w). Since Q is ?nite, it has ?nitely many subsets. Thus we can simulate an NFA with state set Q with a DFA that has a state for each subset of Q. The process of constructing a deterministic analog of a non-deterministic machine is known as determinization.

Posted Date: 3/21/2013 2:55:40 AM | Location : United States







Related Discussions:- Equivalence of nfas and dfas, Assignment Help, Ask Question on Equivalence of nfas and dfas, Get Answer, Expert's Help, Equivalence of nfas and dfas Discussions

Write discussion on Equivalence of nfas and dfas
Your posts are moderated
Related Questions
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?


Let G be a graph with n > 2 vertices with (n2 - 3n + 4)/2 edges. Prove that G is connected.

When we study computability we are studying problems in an abstract sense. For example, addition is the problem of, having been given two numbers, returning a third number that is

Distinguish between Mealy and Moore Machine? Construct a Mealy machine that can output EVEN or ODD According to the total no. of 1's encountered is even or odd.

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



Ask queyystion #Minimum 100 words accepted#

write short notes on decidable and solvable problem