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

Assignment Help:

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.


Related Discussions:- Class of local languages is not closed under union

Normal forms, how to convert a grammar into GNF

how to convert a grammar into GNF

Abstract model for an algorithm solving a problem, These assumptions hold f...

These assumptions hold for addition, for instance. Every instance of addition has a unique solution. Each instance is a pair of numbers and the possible solutions include any third

# Help, #Your company has 25 licenses for a computer program, but you disco...

#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

DFA, designing DFA

designing DFA

Turing machine, Design a turing machine to compute x + y (x,y > 0) with x a...

Design a turing machine to compute x + y (x,y > 0) with x an y in unary, seperated by a # (descrition and genereal idea is needed ... no need for all TM moves)

Applying the pumping lemma, Applying the pumping lemma is not fundamentally...

Applying the pumping lemma is not fundamentally di?erent than applying (general) su?x substitution closure or the non-counting property. The pumping lemma is a little more complica

Mapping reducibility, (c) Can you say that B is decidable? (d) If you someh...

(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?

Myhill-nerode, Theorem (Myhill-Nerode) A language L ⊆ Σ is recognizable iff...

Theorem (Myhill-Nerode) A language L ⊆ Σ is recognizable iff ≡L partitions Σ* into ?nitely many Nerode equivalence classes. Proof: For the "only if" direction (that every recogn

Union, Intuitively, closure of SL 2 under intersection is reasonably easy ...

Intuitively, closure of SL 2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd