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
Kleene called this the Synthesis theorem because his (and your) proof gives an effective procedure for synthesizing an automaton that recognizes the language denoted by any given r

Computation of a DFA or NFA without ε-transitions An ID (q 1 ,w 1 ) computes (qn,wn) in A = (Q,Σ, T, q 0 , F) (in zero or more steps) if there is a sequence of IDs (q 1

We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also

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

automata of atm machine

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

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

The fact that SL 2 is closed under intersection but not under union implies that it is not closed under complement since, by DeMorgan's Theorem L 1 ∩ L 2 = We know that


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