Class of local languages is not closed under union, Theory of Computation

Both L1 and L2 are SL2. (You should verify this by thinking about what the automata look like.)

2360_Class of local languages is not closed under union.png

We claim that L1 ∪ L2 ∈ SL2. To see this, suppose, by way of contradiction, that it was SL2. Then it would satisfy Suffx Substitution Closure. But abb ∈ L1 ∪ L2, since it is in L1, and bba ∈ L1 ∪ L2, since it is in L2, and, by Suffx Substitution Closure, this implies that aba ∈ L1 ∪ L2, which is not the case. Hence, L1 ∪ L2 is not SL2.

It's important to not misunderstand the weight of this result. It does not show that every union of two SL2 languages is not SL2-after all, the union of any SL2 language with itself must, necessarily, be SL2. It is easy to come up with pairs of distinct SL2 languages which yield an SL2 union as well,

1737_Class of local languages is not closed under union1.png

What it does say is that one can't count on the union of SL2 languages being SL2. This is in contrast to the closure result for intersection, which lets us build up languages out of simpler SL2 languages using intersection with con?dence that the result will be SL2. Showing that our desired language is the union of some simple SL2 languages doesn't help us. The result may or may not be SL.

Posted Date: 3/22/2013 12:53:40 AM | Location : United States







Related Discussions:- Class of local languages is not closed under union, Assignment Help, Ask Question on Class of local languages is not closed under union, Get Answer, Expert's Help, Class of local languages is not closed under union Discussions

Write discussion on Class of local languages is not closed under union
Your posts are moderated
Related Questions

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

The fundamental idea of strictly local languages is that they are speci?ed solely in terms of the blocks of consecutive symbols that occur in a word. We'll start by considering lan


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

#Your company has 25 licenses for a computer program, but you discover that it has been copied onto 80 computers. You informed your supervisor, but he/she is not willing to take an


what problems are tackled under numerical integration

Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of

The key thing about the Suffx Substitution Closure property is that it does not make any explicit reference to the automaton that recognizes the language. While the argument tha