Instantaneous description - recognizable language, Theory of Computation

Assignment Help:

De?nition (Instantaneous Description) (for both DFAs and NFAs)

An instantaneous description of A = (Q,Σ, δ, q0, F), either a DFA or an NFA, is a pair hq,wi ∈ Q×Σ*, where q the current state and w is the portion of the input under and to the right of the read head.

The directly computes relation is also the same.

De?nition (Directly Computes Relation) (for both DFAs and NFAs without ε-transitions).

210_recognizable language.png

 

Note that while this is de?ned identically for both DFAs and NFAs, in the case of NFAs it is no longer even partial functional; an ID may well have many successors. Moreover, it is no longer true that the only IDs without successors are those in which w = ε. The effect of this is that the transition function (δ(q, σ)) as we de?ned it earlier is no longer total or even functional: there may be some q and σ for which δ(q, σ) is not de?ned (in notation: δ(q, σ)↑) and there may be some q and σ for which there are multiple states which could be the value of δ(q, σ). We can accommodate both of these possibilities by taking the transition function for NFAs to be a function returning a set of states.


Related Discussions:- Instantaneous description - recognizable language

Ogdens lemma, proof ogdens lemma .with example i am not able to undestand ...

proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .

Computer Simulation, Generate 100 random numbers with the exponential distr...

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?

Pumping lemma, For every regular language there is a constant n depending o...

For every regular language there is a constant n depending only on L such that, for all strings x ∈ L if |x| ≥ n then there are strings u, v and w such that 1. x = uvw, 2. |u

Suffix substitution , Exercise Show, using Suffix Substitution Closure, tha...

Exercise Show, using Suffix Substitution Closure, that L 3 . L 3 ∈ SL 2 . Explain how it can be the case that L 3 . L 3 ∈ SL 2 , while L 3 . L 3 ⊆ L + 3 and L + 3 ∈ SL

Emptiness problem, The Emptiness Problem is the problem of deciding if a gi...

The Emptiness Problem is the problem of deciding if a given regular language is empty (= ∅). Theorem 4 (Emptiness) The Emptiness Problem for Regular Languages is decidable. P

# Help, #Your company has 25 licenses for a computer program, but you disco...

#Your company has 25 licenses for a computer program, but you discover that it has been copied onto 80 computers. You informed your supervisor, but he/she is not willing to take an

Merging nodes, Another striking aspect of LTk transition graphs is that the...

Another striking aspect of LTk transition graphs is that they are generally extremely ine?cient. All we really care about is whether a path through the graph leads to an accepting

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