Transition graphs, Theory of Computation

We represented SLk automata as Myhill graphs, directed graphs in which the nodes were labeled with (k-1)-factors of alphabet symbols (along with a node labeled ‘?' and one labeled ‘?') and the edges were labeled with individual alphabet symbols. The k-factors of the automaton could be recovered by appending the symbol on an edge to the factor of the node it is incident from. The key value of the graphs is the way that they capture the set of all computations of the automaton in a concise form: every computation of the automaton corresponds to a path through the automaton from ‘?' to ‘?' and vice versa. The su?x substitution closure property is, in essence, a consequence of this fact. All that is signi?cant about the initial portion of a computation is the node it ends on. All strings that lead to the same node are equivalent in the sense that any continuation that extends one of them to form a string that is accepted will extend any of them to form a string that is accepted, and any continuation that leads one of them to be rejected will lead any of them to be rejected.

In adapting this idea for LTk automata, we have to confront the fact that the last k - 1 symbols of the input are no longer enough to characterize the initial portion of a string. We now will also need the record of all k-factors which occurred in that initial portion. To accommodate this, we will extend the labeling of our nodes to include sets of k-factors. The node set will be pairs in which the ?rst component is a k - 1 factor (the last k - 1 symbols of the input) and the second component is a set of k-factors. At the initial node, not having scanned any of the input yet, we have seen no k-factors, that is, the initial set of k-factors is empty (∅). The label of the initial node, then is (?, ∅).

Posted Date: 3/21/2013 3:21:04 AM | Location : United States







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

Write discussion on Transition graphs
Your posts are moderated
Related Questions
Claim Under the assumptions above, if there is an algorithm for checking a problem then there is an algorithm for solving the problem. Before going on, you should think a bit about


The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

Ask question #Minimum 100 words accepte

One might assume that non-closure under concatenation would imply non closure under both Kleene- and positive closure, since the concatenation of a language with itself is included

Give the Myhill graph of your automaton. (You may use a single node to represent the entire set of symbols of the English alphabet, another to represent the entire set of decima

What is the Best way to write algorithm and construct flow chart? What is Computer? How to construct web page and Designe it?

Theorem The class of recognizable languages is closed under Boolean operations. The construction of the proof of Lemma 3 gives us a DFA that keeps track of whether or not a give

Design a turing machine to compute x + y (x,y > 0) with x an y in unary, seperated by a # (descrition and genereal idea is needed ... no need for all TM moves)

We now add an additional degree of non-determinism and allow transitions that can be taken independent of the input-ε-transitions. Here whenever the automaton is in state 1