Suffix substitution closure, Theory of Computation

Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators lets us do this by considering the characteristics of the tilings they build. Consider, for instance the situation in the top half of Figure 5, where there are two tilings u1σv1 and u2σv2 in which the symbol ‘σ' occurs. Clearly, after having built u1σ we had the choice of continuing with either v1 or with v2. We had the same choice after having built u2σ. Hence both of the tilings in the bottom half are constructable as well.

What this means for the strings, is that the question of whether we can extend a particular string to produce a longer string that is in the language depends only on the last symbol of that string.

Posted Date: 3/21/2013 6:09:41 AM | Location : United States







Related Discussions:- Suffix substitution closure, Assignment Help, Ask Question on Suffix substitution closure, Get Answer, Expert's Help, Suffix substitution closure Discussions

Write discussion on Suffix substitution closure
Your posts are moderated
Related Questions
We can then specify any language in the class of languages by specifying a particular automaton in the class of automata. We do that by specifying values for the parameters of the

distinguish between histogram and historigram

#can you solve a problem of palindrome using turing machine with explanation and diagrams?

In general non-determinism, by introducing a degree of parallelism, may increase the accepting power of a model of computation. But if we subject NFAs to the same sort of analysis


The initial ID of the automaton given in Figure 3, running on input ‘aabbba' is (A, aabbba) The ID after the ?rst three transitions of the computation is (F, bba) The p

How useful is production function in production planning?

how many pendulum swings will it take to walk across the classroom?

Computer has a single FIFO queue of ?xed precision unsigned integers with the length of the queue unbounded. You can use access methods similar to those in the third model. In this

Exercise:  Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L r . Justify the correctness of your construction.