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
I want a proof for any NP complete problem

how to convert a grammar into GNF

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

RESEARCH POSTER FOR MEALY MACHINE

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

When we say "solved algorithmically" we are not asking about a speci?c programming language, in fact one of the theorems in computability is that essentially all reasonable program


. On July 1, 2010, Harris Co. issued 6,000 bonds at $1,000 each. The bonds paid interest semiannually at 5%. The bonds had a term of 20 years. At the time of issuance, the market r

The Last Stop Boutique is having a five-day sale. Each day, starting on Monday, the price will drop 10% of the previous day’s price. For example, if the original price of a product

Theorem The class of recognizable languages is closed under Boolean operations. The construction of the proof of Lemma 3 gives us a DFA that keeps track of whether or not a give