Non-determinism - recognizable language, Theory of Computation

Our DFAs are required to have exactly one edge incident from each state for each input symbol so there is a unique next state for every current state and input symbol. Thus, the next state is fully determined by the current state and input symbol. As we saw in the previous section, this simpli?es the proof that the DFA accepts a speci?c language. There are many circumstances, though, in which it will be simpler to de?ne the automaton in the ?rst place if we allow for there to be any one of a number of next states or even no next state at all. Thus there may be many out edges from a given node labeled with a given symbol, or no out edges from that node for that symbol. Such FSA are called non-deterministic because the next step of a computation is not fully determined by the current state and input symbol-we may have a choice of states to move into.

De?nition 1 (NFA without ε-Transitions) A FSA A = (Q,Σ, T, q0, F) is non-deterministic iff either

• there is some q ∈ Q, σ ∈ Σ and p1 = p2 ∈ Q for which hq, p1, σi ∈ T and hq, p2, σi ∈ T,

• or there is some q ∈ Q, σ ∈ Σ for which there is no p ∈ Q such that hq, p, σi ∈ T

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







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

Write discussion on Non-determinism - recognizable language
Your posts are moderated
Related Questions
The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

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

. 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

De?nition Instantaneous Description of an FSA: An instantaneous description (ID) of a FSA A = (Q,Σ, T, q 0 , F) is a pair (q,w) ∈ Q×Σ* , where q the current state and w is the p

Intuitively, closure of SL 2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a

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

Computer has a single unbounded precision counter which you can only increment, decrement and test for zero. (You may assume that it is initially zero or you may include an explici

how to convert a grammar into GNF

distinguish between histogram and historigram

write short notes on decidable and solvable problem