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
design a tuning machine for penidrome


When we study computability we are studying problems in an abstract sense. For example, addition is the problem of, having been given two numbers, returning a third number that is

We have now de?ned classes of k-local languages for all k ≥ 2. Together, these classes form the Strictly Local Languages in general. De?nition (Strictly Local Languages) A langu

Let G be a graph with n > 2 vertices with (n2 - 3n + 4)/2 edges. Prove that G is connected.


write short notes on decidable and solvable problem

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

Strictly 2-local automata are based on lookup tables that are sets of 2-factors, the pairs of adjacent symbols which are permitted to occur in a word. To generalize, we extend the

Normal forms are important because they give us a 'standard' way of rewriting and allow us to compare two apparently different grammars G1  and G2. The two grammars can be shown to