Generalization of the interpretation of local automata, Theory of Computation

The generalization of the interpretation of strictly local automata as generators is similar, in some respects, to the generalization of Myhill graphs. Again, the set of possible symbols that may appear at any given point depends only on the previous k - 1 symbols. Here this is realized by taking the factors to be tiles and allowing a tile labeled σ2, . . . , σk, σk+1 to be placed over the last k-1 symbols of a tile labeled σ1, σ2, . . . , σk. Again, the process starts with a tile labeled 'x  ' and ends when a tile labeled '  x' is placed. Strings of length less than k - 1 are generated with a single tile.

Note that there is a sense in which this mechanism is the dual of the k-local Myhill graphs. In the graphs, the vertices are labeled with the pre?x of the factors in the automaton and the edges are labeled with the last symbol of the label of the node the edge is incident to. It is those edge labels that call out the string being recognized and the initial k - 1 positions of the string label the edges incident from ‘x'. Here it is the exposed symbols that call out the string being generated and these are the initial symbols of the tiles. And the ?nal k -1 symbols of the string are the symbols labeling the last tile, the one labeled with ‘x'.

Posted Date: 3/22/2013 1:29:55 AM | Location : United States







Related Discussions:- Generalization of the interpretation of local automata, Assignment Help, Ask Question on Generalization of the interpretation of local automata, Get Answer, Expert's Help, Generalization of the interpretation of local automata Discussions

Write discussion on Generalization of the interpretation of local automata
Your posts are moderated
Related Questions
All that distinguishes the de?nition of the class of Regular languages from that of the class of Star-Free languages is that the former is closed under Kleene closure while the lat

Ask question #hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhMinimum 100 words accepted#

proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .

Theorem The class of ?nite languages is a proper subclass of SL. Note that the class of ?nite languages is closed under union and concatenation but SL is not closed under either. N

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

The Last Stop Boutique is having a five-day sale. Each day, starting on Monday, the price will drop 10% of the previous day’s price. For example, if the original price of a product


The generalization of the interpretation of strictly local automata as generators is similar, in some respects, to the generalization of Myhill graphs. Again, the set of possible s

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

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