Language accepted by a nfa, Theory of Computation

Assignment Help:

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.


Related Discussions:- Language accepted by a nfa

Automata answer, build a TM that enumerate even set of even length string o...

build a TM that enumerate even set of even length string over a

Finite languages and strictly local languages, Theorem The class of ?nite l...

Theorem The class of ?nite languages is a proper subclass of SL. Note that the class of ?nite languages is closed under union and concatenation but SL is not closed under either. N

Instantaneous description - recognizable language, De?nition (Instantaneous...

De?nition (Instantaneous Description) (for both DFAs and NFAs) An instantaneous description of A = (Q,Σ, δ, q 0 , F) , either a DFA or an NFA, is a pair h q ,w i ∈ Q×Σ*, where

Formal language theory, This was one of the ?rst substantial theorems of Fo...

This was one of the ?rst substantial theorems of Formal Language Theory. It's maybe not too surprising to us, as we have already seen a similar equivalence between LTO and SF. But

Local myhill graphs, Myhill graphs also generalize to the SLk case. The k-f...

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

Computation and languages, When we study computability we are studying prob...

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

Strictly k-local automata, Strictly 2-local automata are based on lookup ta...

Strictly 2-local automata are based on lookup tables that are sets of 2-factors, the pairs of adjacent symbols which are permitted to occur in a word. To generalize, we extend the

Possibility of recognizing the palindrome language, Computer has a single F...

Computer has a single FIFO queue of ?xed precision unsigned integers with the length of the queue unbounded. You can use access methods similar to those in the third model. In this

Automaton theory, let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start ...

let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start symbol and P={S->Aba, A->BB, B->ab,AB->b} 1.show the derivation sentence for the string ababba 2. find a sentential form

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd