Language accepted by a nfa, Theory of Computation

The language accepted by a NFA A = (Q,Σ, δ, q0, F) is

1377_Language Accepted by a NFA.png

NFAs correspond to a kind of parallelism in the automata. We can think of the same basic model of automaton: an input tape, a single read head and an internal state, but when the transition function allows more than one next state for a given state and input we keep an independent internal state for each of the alternatives. In a sense we have a constantly growing and shrinking set of automata all processing the same input synchronously. For example, a computation of the NFA given above on ‘abaab' could be interpreted as:

This string is accepted, since there is at least one computation from 0 to 0 or 2 on ‘abaab'. Similarly, each of ‘ε', ‘ab', ‘aba' and ‘abaa' are accepted, but ‘a' alone is not. Note that if the input continues with ‘b' as shown there will be no states left; the automaton will crash. Clearly, it can accept no string starting with ‘abaabb' since the computations from 0 or ‘abaabb' end either in h0, bi or in h2, bi and, consequentially, so will all computations from 0 on any string extending it. The fact that in this model there is not necessarily a (non-crashing) computation from q0 for each string complicates the proof of the language accepted by the automaton-we can no longer assume that if there is no (non-crashing) computation from q0 to a ?nal state on w then there must be a (non-crashing) computation from q0 to a non-?nal state on w. As we shall see, however, we will never need to do such proofs for NFAs directly.

Posted Date: 3/21/2013 2:39:08 AM | Location : United States







Related Discussions:- Language accepted by a nfa, Assignment Help, Ask Question on Language accepted by a nfa, Get Answer, Expert's Help, Language accepted by a nfa Discussions

Write discussion on Language accepted by a nfa
Your posts are moderated
Related Questions
The Myhill-Nerode Theorem provided us with an algorithm for minimizing DFAs. Moreover, the DFA the algorithm produces is unique up to isomorphism: every minimal DFA that recognizes

Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG too. Let M1 be a decider for L1 and M2 be a decider for L2 . Consider a 2-tape TM M: "On input x: 1. copy x on the sec

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

The class of Strictly Local Languages (in general) is closed under • intersection but is not closed under • union • complement • concatenation • Kleene- and positive

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

Let ? ={0,1} design a Turing machine that accepts L={0^m 1^m 2^m } show using Id that a string from the language is accepted & if not rejected .


s->0A0|1B1|BB A->C B->S|A C->S|null find useless symbol?

What is the Best way to write algorithm and construct flow chart? What is Computer? How to construct web page and Designe it?

distinguish between histogram and historigram