Nfas with e-transitions, Theory of Computation

We now add an additional degree of non-determinism and allow transitions that can be taken independent of the input-ε-transitions.

2367_NFAs with Transitions.png

Here whenever the automaton is in state 1 it may make a transition to state 3 without consuming any input. Similarly, if it is in state 0 it may make such a transition to state 2. The advantage of such transitions is that they allow one to build NFAs in pieces, with each piece handling some portion of the language, and then splice the pieces together to form an automaton handling the entire language. To accommodate these transitions we need to modify the type of the transition relation to allow edges labeled ε.

Posted Date: 3/21/2013 2:41:25 AM | Location : United States







Related Discussions:- Nfas with e-transitions, Assignment Help, Ask Question on Nfas with e-transitions, Get Answer, Expert's Help, Nfas with e-transitions Discussions

Write discussion on Nfas with e-transitions
Your posts are moderated
Related Questions
The fact that the Recognition Problem is decidable gives us another algorithm for deciding Emptiness. The pumping lemma tells us that if every string x ∈ L(A) which has length grea

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

De?nition Instantaneous Description of an FSA: An instantaneous description (ID) of a FSA A = (Q,Σ, T, q 0 , F) is a pair (q,w) ∈ Q×Σ* , where q the current state and w is the p


We have now de?ned classes of k-local languages for all k ≥ 2. Together, these classes form the Strictly Local Languages in general. De?nition (Strictly Local Languages) A langu


s-> AACD A-> aAb/e C->aC/a D-> aDa/bDb/e

examples of decidable problems

In Exercise 9 you showed that the recognition problem and universal recognition problem for SL2 are decidable. We can use the structure of Myhill graphs to show that other problems

how to find whether the language is cfl or not?