Myhill graphs, Theory of Computation

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.

Posted Date: 3/21/2013 5:54:10 AM | Location : United States







Related Discussions:- Myhill graphs, Assignment Help, Ask Question on Myhill graphs, Get Answer, Expert's Help, Myhill graphs Discussions

Write discussion on Myhill graphs
Your posts are moderated
Related Questions
Exercise:  Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L r . Justify the correctness of your construction.

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

constract context free g ={ a^n b^m : m,n >=0 and n

The k-local Myhill graphs provide an easy means to generalize the suffix substitution closure property for the strictly k-local languages. Lemma (k-Local Suffix Substitution Clo

Ask queyystion #Minimum 100 words accepted#

how to understand DFA ?

shell script to print table in given range

Computer has a single LIFO stack containing ?xed precision unsigned integers (so each integer is subject to over?ow problems) but which has unbounded depth (so the stack itself nev

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 .

conversion from nfa to dfa 0 | 1 ___________________ p |{q,s}|{q} *q|{r} |{q,r} r |(s) |{p} *s|null |{p}