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

Turing machine, Can v find the given number is palindrome or not using turi...

Can v find the given number is palindrome or not using turing machine

Algorithm, What is the Best way to write algorithm and construct flow chart...

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

Chomsky normal form, s->0A0|1B1|BB A->C B->S|A C->S|null find useless symbo...

s->0A0|1B1|BB A->C B->S|A C->S|null find useless symbol?

Decision Theroy, spam messages h= 98%, m= 90%, l= 80% non spam h=12%, m = 8...

spam messages h= 98%, m= 90%, l= 80% non spam h=12%, m = 8%, l= 5% The organization estimates that 75% of all messages it receives are spam messages. If the cost of not blocking a

Formal languages and grammar, The universe of strings is a very useful medi...

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

Pendulum Swings, how many pendulum swings will it take to walk across the c...

how many pendulum swings will it take to walk across the classroom?

# 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

Mapping reducibility, (c) Can you say that B is decidable? (d) If you someh...

(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?

Class of recognizable languages, Proof (sketch): Suppose L 1 and L 2 are ...

Proof (sketch): Suppose L 1 and L 2 are recognizable. Then there are DFAs A 1 = (Q,Σ, T 1 , q 0 , F 1 ) and A 2 = (P,Σ, T 2 , p 0 , F 2 ) such that L 1 = L(A 1 ) and L 2 = L(

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