Finite-state automaton, Theory of Computation

Assignment Help:

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.


Related Discussions:- Finite-state automaton

Project, can you plz help with some project ideas relatede to DFA or NFA or...

can you plz help with some project ideas relatede to DFA or NFA or anything

Equivalence problem, The Equivalence Problem is the question of whether two...

The Equivalence Problem is the question of whether two languages are equal (in the sense of being the same set of strings). An instance is a pair of ?nite speci?cations of regular

Applying the pumping lemma, Applying the pumping lemma is not fundamentally...

Applying the pumping lemma is not fundamentally di?erent than applying (general) su?x substitution closure or the non-counting property. The pumping lemma is a little more complica

Computations of sl automata, We will specify a computation of one of these ...

We will specify a computation of one of these automata by specifying the pair of the symbols that are in the window and the remainder of the string to the right of the window at ea

Suffix substitution closure, Our primary concern is to obtain a clear chara...

Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

Operator p, implementation of operator precedence grammer

implementation of operator precedence grammer

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd