Finite-state automaton, Theory of Computation

Paths leading to regions B, C and E are paths which have not yet seen aa. Those leading to region B and E end in a, with those leading to E having seen ba and those leading to B not (there is only one such path). Those leading to region C end in b. Note that once we are in region C the question of whether we have seen bb or not is no longer relevant; in order to accept we must see aa and, since the path has ended with b, we cannot reach aa without ?rst seeing ba (hence, passing through region E). Finally, in region A we have not looked at anything yet. This where the empty string ends up.

331_Finite-state automaton.png

Putting this all together, there is no reason to distinguish any of the nodes that share the same region. We could replace them all with a single node. What matters is the information that is relevant to determining if a string should be accepted or can be extended to one that should be. In keeping with this insight, we will generalize our notion of transition graphs to graphs with an arbitrary, ?nite, set of nodes distinguishing the signi?cant states of the computation and edges that represent the transitions the automaton makes from one state to another as it scans the input. Figure 3 represents such a graph for the minimal equivalent of the automaton of Figure 1.

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







Related Discussions:- Finite-state automaton, Assignment Help, Ask Question on Finite-state automaton, Get Answer, Expert's Help, Finite-state automaton Discussions

Write discussion on Finite-state automaton
Your posts are moderated
Related Questions

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

How useful is production function in production planning?

Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = {q 0 , q 1 , . . . , q n-1 } includes n states. Thinking of the automaton in terms of its transition graph, a string x is recogn

Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of

We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also

Give DFA''s accepting the following languages over the alphabet {0,1}: i. The set of all strings beginning with a 1 that, when interpreted as a binary integer, is a multiple of 5.

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

Theorem (Myhill-Nerode) A language L ⊆ Σ is recognizable iff ≡L partitions Σ* into ?nitely many Nerode equivalence classes. Proof: For the "only if" direction (that every recogn

We can then specify any language in the class of languages by specifying a particular automaton in the class of automata. We do that by specifying values for the parameters of the