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
Another way of interpreting a strictly local automaton is as a generator: a mechanism for building strings which is restricted to building all and only the automaton as an inexh

The Recognition Problem for a class of languages is the question of whether a given string is a member of a given language. An instance consists of a string and a (?nite) speci?cat

The computation of an SL 2 automaton A = ( Σ, T) on a string w is the maximal sequence of IDs in which each sequential pair of IDs is related by |- A and which starts with the in

The path function δ : Q × Σ* → P(Q) is the extension of δ to strings: This just says that the path labeled ε from any given state q goes only to q itself (or rather never l

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

Let there L1 and L2 . We show that L1 ∩ L2 is CFG . 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 second

Automata and Compiler (1) [25 marks] Let N be the last two digits of your student number. Design a finite automaton that accepts the language of strings that end with the last f

matlab v matlab

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