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
how to understand DFA ?

write short notes on decidable and solvable problem

can you plz help with some project ideas relatede to DFA or NFA or anything

Since the signi?cance of the states represented by the nodes of these transition graphs is arbitrary, we will allow ourselves to use any ?nite set (such as {A,B,C,D,E, F,G,H} or ev

The path function δ : Q × Σ* → P(Q) is the extension of δ to strings: This just says that the path labeled ε from any given state q goes only to q itself (or rather never l

Paths leading to regions B, C and E are paths which have not yet seen aa. Those leading to region B and E end in a, with those leading to E having seen ba and those leading to B no

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

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

Automata and Compiler (1) [25 marks] Let N be the last two digits of your student number. Design a finite automaton that accepts the language of strings that end with the last f

i want to do projects for theory of computation subject what topics should be best.