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

Numerical integration, what problems are tackled under numerical integratio...

what problems are tackled under numerical integration

Decision problems, In Exercise 9 you showed that the recognition problem an...

In Exercise 9 you showed that the recognition problem and universal recognition problem for SL2 are decidable. We can use the structure of Myhill graphs to show that other problems

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

State and Prove the Arden's theorem for Regular Expression

Xx, Ask queyystion #Minimum 100 words accepted#

Ask queyystion #Minimum 100 words accepted#

Kleene closure, So we have that every language that can be constructed from...

So we have that every language that can be constructed from SL languages using Boolean operations and concatenation (that is, every language in LTO) is recognizable but there are r

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

Abstract model for an algorithm solving a problem, These assumptions hold f...

These assumptions hold for addition, for instance. Every instance of addition has a unique solution. Each instance is a pair of numbers and the possible solutions include any third

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