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
turing machine for prime numbers

a) Let n be the pumping lemma constant. Then if L is regular, PL implies that s can be decomposed into xyz, |y| > 0, |xy| ≤n, such that xy i z is in L for all i ≥0. Since the le

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

A Turing machine is a theoretical computing machine made-up by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine having of a line of

what are composition and its function of gastric juice

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

Let L 3 = {a i bc j | i, j ≥ 0}. Give a strictly 2-local automaton that recognizes L 3 . Use the construction of the proof to extend the automaton to one that recognizes L 3 . Gi

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.

conversion from nfa to dfa 0 | 1 ___________________ p |{q,s}|{q} *q|{r} |{q,r} r |(s) |{p} *s|null |{p}

what problems are tackled under numerical integration