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

Non - sl languages, The key thing about the Suffx Substitution Closure prop... 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

Operator p, implementation of operator precedence grammer implementation of operator precedence grammer

Constract Context free, constract context free g ={ a^n b^m : m,n >=0 and n... constract context free g ={ a^n b^m : m,n >=0 and n

Context free grammar, A context free grammar G = (N, Σ, P, S)  is in binary... A context free grammar G = (N, Σ, P, S)  is in binary form if for all productions A we have |α| ≤ 2. In addition we say that G is in Chomsky Normaml Form (CNF) if it is in bi

Toc, how to understand DFA ? how to understand DFA ?

Mealy machine, Construct a Mealy machine that can output EVEN or ODD Accord... Construct a Mealy machine that can output EVEN or ODD According to the total no. of 1''s encountered is even or odd.

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.

First model of computation, Computer has a single unbounded precision count... Computer has a single unbounded precision counter which you can only increment, decrement and test for zero. (You may assume that it is initially zero or you may include an explici

Pojects idea, i want to do projects for theory of computation subject what ... i want to do projects for theory of computation subject what topics should be best.

Sdsdsd, dsdsd dsdsd