Myhill graphs, Theory of Computation

Assignment Help:

Another way of representing a strictly 2-local automaton is with a Myhill graph. These are directed graphs in which the vertices are labeled with symbols from the input alphabet of the automaton (plus {x,x}), with an edge from a vertex labeled σ1 to a vertex labeled σ2 ix the pair σ1σ2 is included in T. (Note that if we interpret the strings in T as pairs of symbols, then the Myhill graph of A = (Σ, T) is just G = (Σ+, T).) The Myhill graph of the automaton of Figure 2 is given in Figure. For consistency with the graphs we will use later, the entry point to the graph is indicated with an edge "from nowhere" and the exit point is indicated by circling it.

The key property of Myhill graphs is that every path through the graph from the ‘x' node to the ‘x' node corresponds to a computation of the automaton and every computation of the automaton corresponds to such a path. So we can reason about the strings that are accepted by the automaton by reasoning about the sequences of nodes that occur on paths from ‘x' to ‘x'. (For simplicity, we will refer to paths from ‘x' to ‘x' as "paths through the graph".)

For example, the shortest strings in the language recognized by the automaton will those labeling the shortest paths through the graph, which is to say, the acyclic paths from ‘x' to ‘x'. In this particular case, these are the paths (x,x) and (x, a, b,x), corresponding to the strings ε and ab.


Related Discussions:- Myhill graphs

Grammer, write grammer to produce all mathematical expressions in c.

write grammer to produce all mathematical expressions in c.

Agents architecture, Describe the architecture of interface agency

Describe the architecture of interface agency

Trees and graphs , Trees and Graphs Overview: The problems for this ...

Trees and Graphs Overview: The problems for this assignment should be written up in a Mircosoft Word document. A scanned hand written file for the diagrams is also fine. Be

Pumping lemma, For every regular language there is a constant n depending o...

For every regular language there is a constant n depending only on L such that, for all strings x ∈ L if |x| ≥ n then there are strings u, v and w such that 1. x = uvw, 2. |u

Programming languages, Different types of applications and numerous program...

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

# Help, #Your company has 25 licenses for a computer program, but you disco...

#Your company has 25 licenses for a computer program, but you discover that it has been copied onto 80 computers. You informed your supervisor, but he/she is not willing to take an

Language accepted by a nfa, The language accepted by a NFA A = (Q,Σ, δ, q 0...

The language accepted by a NFA A = (Q,Σ, δ, q 0 , F) is NFAs correspond to a kind of parallelism in the automata. We can think of the same basic model of automaton: an inpu

#turing machine, #can you solve a problem of palindrome using turing machin...

#can you solve a problem of palindrome using turing machine with explanation and diagrams?

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