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

Possibility of recognizing the palindrome language, Computer has a single F...

Computer has a single FIFO queue of ?xed precision unsigned integers with the length of the queue unbounded. You can use access methods similar to those in the third model. In this

#dfa, Give DFA''s accepting the following languages over the alphabet {0,1}...

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.

Strictly 2-local languages, The fundamental idea of strictly local language...

The fundamental idea of strictly local languages is that they are speci?ed solely in terms of the blocks of consecutive symbols that occur in a word. We'll start by considering lan

Designing finite automata, a finite automata accepting strings over {a,b} e...

a finite automata accepting strings over {a,b} ending in abbbba

Gephi, construct a social network from the real-world data, perform some si...

construct a social network from the real-world data, perform some simple network analyses using Gephi, and interpret the results.

Production, How useful is production function in production planning?

How useful is production function in production planning?

Non-determinism - recognizable language, Our DFAs are required to have exac...

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 ne

Closure properties to prove regularity, The fact that regular languages are...

The fact that regular languages are closed under Boolean operations simpli?es the process of establishing regularity of languages; in essence we can augment the regular operations

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