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
The SL 2 languages are speci?ed with a set of 2-factors in Σ 2 (plus some factors in {?}Σ and some factors in Σ{?} distinguishing symbols that may occur at the beginning and en

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

Myhill graphs also generalize to the SLk case. The k-factors, however, cannot simply denote edges. Rather the string σ 1 σ 2 ....... σ k-1 σ k asserts, in essence, that if we hav

proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .

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



Trees and Graphs Overview: The problems for this assignment should be written up in a Mircosoft Word document. A scanned hand written file for the diagrams is also fine. Be


When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one