Instantaneous description - recognizable language, Theory of Computation

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.

Posted Date: 3/21/2013 2:21:21 AM | Location : United States







Related Discussions:- Instantaneous description - recognizable language, Assignment Help, Ask Question on Instantaneous description - recognizable language, Get Answer, Expert's Help, Instantaneous description - recognizable language Discussions

Write discussion on Instantaneous description - recognizable language
Your posts are moderated
Related Questions
Claim Under the assumptions above, if there is an algorithm for checking a problem then there is an algorithm for solving the problem. Before going on, you should think a bit about

what are the advantages and disadvantages of wearable computers?

One might assume that non-closure under concatenation would imply non closure under both Kleene- and positive closure, since the concatenation of a language with itself is included

what problems are tackled under numerical integration

The fact that regular languages are closed under Boolean operations simpli?es the process of establishing regularity of languages; in essence we can augment the regular operations

We now add an additional degree of non-determinism and allow transitions that can be taken independent of the input-ε-transitions. Here whenever the automaton is in state 1

What are the benefits of using work breakdown structure, Project Management


constract context free g ={ a^n b^m : m,n >=0 and n