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
The path function δ : Q × Σ* → P(Q) is the extension of δ to strings: This just says that the path labeled ε from any given state q goes only to q itself (or rather never l

Ask question #Minimum 100 words accepte

Rubber shortnote


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

In Exercise 9 you showed that the recognition problem and universal recognition problem for SL2 are decidable. We can use the structure of Myhill graphs to show that other problems

Let ? ={0,1} design a Turing machine that accepts L={0^m 1^m 2^m } show using Id that a string from the language is accepted & if not rejected .

Differentiate between DFA and NFA. Convert the following Regular Expression into DFA. (0+1)*(01*+10*)*(0+1)*. Also write a regular grammar for this DFA.

how to understand DFA ?

Sketch an algorithm for the universal recognition problem for SL 2 . This takes an automaton and a string and returns TRUE if the string is accepted by the automaton, FALSE otherwi