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
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

#can you solve a problem of palindrome using turing machine with explanation and diagrams?

S-->AAA|B A-->aA|B B-->epsilon

The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

If the first three words are the boys down,what are the last three words??

Computation of a DFA or NFA without ε-transitions An ID (q 1 ,w 1 ) computes (qn,wn) in A = (Q,Σ, T, q 0 , F) (in zero or more steps) if there is a sequence of IDs (q 1

what are the advantages and disadvantages of wearable computers?

(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?

how to prove he extended transition function is derived from part 2 and 3

I want a proof for any NP complete problem