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

Instantaneous description of an fsa, De?nition Instantaneous Description 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

Normal forms, how to convert a grammar into GNF

how to convert a grammar into GNF

Transition and path functions, When an FSA is deterministic the set of trip...

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

Myhill-nerode, Theorem (Myhill-Nerode) A language L ⊆ Σ is recognizable iff...

Theorem (Myhill-Nerode) A language L ⊆ Σ is recognizable iff ≡L partitions Σ* into ?nitely many Nerode equivalence classes. Proof: For the "only if" direction (that every recogn

Java programming, 1. An integer is said to be a “continuous factored” if it...

1. An integer is said to be a “continuous factored” if it can be expresses as a product of two or more continuous integers greater than 1. Example of continuous factored integers

Binary form and chomsky normal form, Normal forms are important because the...

Normal forms are important because they give us a 'standard' way of rewriting and allow us to compare two apparently different grammars G1  and G2. The two grammars can be shown to

How to solve the checking problem, The objective of the remainder of this a...

The objective of the remainder of this assignment is to get you thinking about the problem of recognizing strings given various restrictions to your model of computation. We will w

Strictly local languages, While the SL 2 languages include some surprising...

While the SL 2 languages include some surprisingly complex languages, the strictly 2-local automata are, nevertheless, quite limited. In a strong sense, they are almost memoryless

Context free grammar, A context free grammar G = (N, Σ, P, S)  is in binary...

A context free grammar G = (N, Σ, P, S)  is in binary form if for all productions A we have |α| ≤ 2. In addition we say that G is in Chomsky Normaml Form (CNF) if it is in bi

Prove the arden''s theorem, State and Prove the Arden's theorem for Regular...

State and Prove the Arden's theorem for Regular Expression

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