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
The Myhill-Nerode Theorem provided us with an algorithm for minimizing DFAs. Moreover, the DFA the algorithm produces is unique up to isomorphism: every minimal DFA that recognizes


LTO was the closure of LT under concatenation and Boolean operations which turned out to be identical to SF, the closure of the ?nite languages under union, concatenation and compl

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

#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

design an automata for strings having exactly four 1''s

Applying the pumping lemma is not fundamentally di?erent than applying (general) su?x substitution closure or the non-counting property. The pumping lemma is a little more complica

how to write program Minimum Cost Calculation - Vogel Approximation Method(VAM

build a TM that enumerate even set of even length string over a

#can you solve a problem of palindrome using turing machine with explanation and diagrams?