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
what are the advantages and disadvantages of wearable computers?

Computer has a single LIFO stack containing ?xed precision unsigned integers (so each integer is subject to over?ow problems) but which has unbounded depth (so the stack itself nev

what problems are tackled under numerical integration

Another way of representing a strictly 2-local automaton is with a Myhill graph. These are directed graphs in which the vertices are labeled with symbols from the input alphabet of

The computation of an SL 2 automaton A = ( Σ, T) on a string w is the maximal sequence of IDs in which each sequential pair of IDs is related by |- A and which starts with the in


design an automata for strings having exactly four 1''s

State and Prove the Arden's theorem for Regular Expression

let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start symbol and P={S->Aba, A->BB, B->ab,AB->b} 1.show the derivation sentence for the string ababba 2. find a sentential form

You are required to design a system that controls the speed of a fan's rotation. The speed at which the fan rotates is determined by the ambient temperature, i.e. as the temperatur