Kleene closure, Theory of Computation

Assignment Help:

One might assume that non-closure under concatenation would imply non closure under both Kleene- and positive closure, since the concatenation of a language with itself is included in its positive closure (that is, L2 ⊆ L+). The intuitive idea is that if we had a counterexample for closure under concatenation that uses just a single language L, then if there was some pair of strings in L2 that invalidates suffx substitution closure-that yields a string not in L2 when the suffx of one is substituted into the other-then that pair would invalidate suffx substitution closure for L* as well. But this argument doesn't work. The fact that the pair yields a string that is not in L2 does not rule out the possibility of string being in Li for some i = 2.

If one thinks in terms of strictly local generation, it should be clear that a language L is strictly 2-local language i? it includes all and only the strings that start with a symbol from some particular subset of Σ and end with a symbol from another such subset, with only  particular pairs of adjacent symbols occurring in between-equivalently, some particular set of forbidden pairs not occurring (see Section 3 of Part 1).

Consider, then L+. Strings in L+ will also start and end with symbols from those subsets of Σ and the adjacent pairs of symbols occurring strictly within the string from a given iteration of L will be only those that are permitted. The only di?erence is that there may be additional adjacent pairs where the strings from successive iterations meet. These we can admit by simply permitting them as well. The question is whether they will allow pairs in the middle of a string from L which should be forbidden. But, since we are only adding pairs in which the left symbol is a permissible ending symbol for a string from L and the right symbol is a permissible starting symbol, everywhere such a pair occurs is a permissible boundary between strings of L. Finally, to extend the construction to get L* all we need to do is add the pair ?? as well.


Related Discussions:- Kleene closure

Pumping lemma, For every regular language there is a constant n depending o...

For every regular language there is a constant n depending only on L such that, for all strings x ∈ L if |x| ≥ n then there are strings u, v and w such that 1. x = uvw, 2. |u

NP complete, I want a proof for any NP complete problem

I want a proof for any NP complete problem

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

IT PRoject Management, What are the benefits of using work breakdown struct...

What are the benefits of using work breakdown structure, Project Management

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.

Discrete math, Find the Regular Grammar for the following Regular Expressio...

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

Closure properties to prove regularity, The fact that regular languages are...

The fact that regular languages are closed under Boolean operations simpli?es the process of establishing regularity of languages; in essence we can augment the regular operations

Shell script, shell script to print table in given range

shell script to print table in given range

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

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