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
Strictly 2-local automata are based on lookup tables that are sets of 2-factors, the pairs of adjacent symbols which are permitted to occur in a word. To generalize, we extend the

So we have that every language that can be constructed from SL languages using Boolean operations and concatenation (that is, every language in LTO) is recognizable but there are r

Theorem The class of ?nite languages is a proper subclass of SL. Note that the class of ?nite languages is closed under union and concatenation but SL is not closed under either. N

1. Simulate a TM with infinite tape on both ends using a two-track TM with finite storage 2. Prove the following language is non-Turing recognizable using the diagnolization

c program to convert dfa to re

The upper string r ∈ Q+ is the sequence of states visited by the automaton as it scans the lower string w ∈ Σ*. We will refer to this string over Q as the run of A on w. The automa

We will assume that the string has been augmented by marking the beginning and the end with the symbols ‘?' and ‘?' respectively and that these symbols do not occur in the input al

Application of the general suffix substitution closure theorem is slightly more complicated than application of the specific k-local versions. In the specific versions, all we had

write short notes on decidable and solvable problem

Different types of applications and numerous programming languages have been developed to make easy the task of writing programs. The assortment of programming languages shows, dif