Strictly local generation automaton, Theory of Computation

Another way of interpreting a strictly local automaton is as a generator: a mechanism for building strings which is restricted to building all and only the

automaton as an inexhaustible set of tiles labeled with the pairs of symbols, infinitely many instances of each type. The generator starts by selecting any tile labeled with 'x' on its left half. It then proceeds by selecting any tile for which the left half symbol matches the symbol on the right half of the previously selected tile and placing it with its left half overlapping the right half of that previous tile. In this way, the sequence of tiles grows until some tile with 'x' on its right half is placed. The generated string is the sequence of exposed symbols, not including the beginning and end symbols. Generation is non-deterministic-at each step the choice of tile is restricted only by the right symbol of the previous tile. A derivation of the generator is just the sequence of choices it makes in assembling a string, a sequence of pairs of symbols. The language generated by the generator is the set of all strings assembled by any of its derivations.

It should be clear that every string assembled by a derivation of the generator will be accepted by the automaton: the computation of the automaton will check the same sequence of pairs as the derivation of the generator uses and each of those pairs will be in the lookup table, hence, the computation will accept. Similarly it should be clear that every string accepted by a computation of the automaton will be assembled by the corresponding derivation of the generator.

Posted Date: 3/21/2013 6:06:47 AM | Location : United States

Related Discussions:- Strictly local generation automaton, Assignment Help, Ask Question on Strictly local generation automaton, Get Answer, Expert's Help, Strictly local generation automaton Discussions

Write discussion on Strictly local generation automaton
Your posts are moderated
Related Questions
We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

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

As de?ned the powerset construction builds a DFA with many states that can never be reached from Q′ 0 . Since they cannot be reached from Q′ 0 there is no path from Q′ 0 to a sta

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

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?

State & prove pumping lemma for regular set. Show that for the language L={ap |p is a prime} is not regular


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

The Emptiness Problem is the problem of deciding if a given regular language is empty (= ∅). Theorem 4 (Emptiness) The Emptiness Problem for Regular Languages is decidable. P

build a TM that enumerate even set of even length string over a