Transition graphs, Theory of Computation

Assignment Help:

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 (?, ∅).


Related Discussions:- Transition graphs

Gastric juice, what are composition and its function of gastric juice

what are composition and its function of gastric juice

Computer Simulation, Generate 100 random numbers with the exponential distr...

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?

Myhill graph of the automaton, Exercise:  Give a construction that converts...

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.

Kleene closure, One might assume that non-closure under concatenation would...

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

Boolean operations - class of recognizable languages, Theorem The class of ...

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

Construct a regular expression, Given any NFA A, we will construct a regula...

Given any NFA A, we will construct a regular expression denoting L(A) by means of an expression graph, a generalization of NFA transition graphs in which the edges are labeled with

Convert chomsky normal form into binary form, Suppose G = (N, Σ, P, S) is a...

Suppose G = (N, Σ, P, S) is a reduced grammar (we can certainly reduce G if we haven't already). Our algorithm is as follows: 1. Define maxrhs(G) to be the maximum length of the

Notes, write short notes on decidable and solvable problem

write short notes on decidable and solvable problem

Data retriving, i have research method project and i meef to make prposal w...

i have research method project and i meef to make prposal with topic. If this service here please help me

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