Both L₁ and L₂ are SL₂. (You should verify this by thinking about what the automata look like.)

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

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,

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

Ask an Expert

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

Write your message here..

Related Questions

Answer, And what this money. Invovle who it involves and the fact of,how we... And what this money. Invovle who it involves and the fact of,how we got itself identified candidate and not withstanding time date location. That shouts me media And answers who''v

Prepare the consolidated financial statements, Prepare the consolidated fin... Prepare the consolidated financial statements for the year ended 30 June 2011. On 1 July 2006, Mark Ltd acquired all the share capitall of john Ltd for $700,000. At the date , J

Finite automata, design an automata for strings having exactly four 1''s design an automata for strings having exactly four 1''s

Equivalence problem, The Equivalence Problem is the question of whether two... The Equivalence Problem is the question of whether two languages are equal (in the sense of being the same set of strings). An instance is a pair of ?nite speci?cations of regular

Multitape turing machine, example of multitape turing machine example of multitape turing machine

Instantaneous description - recognizable language, De?nition (Instantaneous... De?nition (Instantaneous Description) (for both DFAs and NFAs) An instantaneous description of A = (Q,Σ, δ, q 0 , F) , either a DFA or an NFA, is a pair h q ,w i ∈ Q×Σ*, where

Third model of computation, Computer has a single LIFO stack containing ?xe... Computer has a single LIFO stack containing ?xed precision unsigned integers (so each integer is subject to over?ow problems) but which has unbounded depth (so the stack itself nev

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

Turing machine , Let ? ={0,1} design a Turing machine that accepts L={0^m ... Let ? ={0,1} design a Turing machine that accepts L={0^m 1^m 2^m } show using Id that a string from the language is accepted & if not rejected .

Create a general algorithm from a checking algorithm, Claim Under the assum... Claim Under the assumptions above, if there is an algorithm for checking a problem then there is an algorithm for solving the problem. Before going on, you should think a bit about