Question: Consider the language K = { ai bi : i in N 0 } . Using the fact that K is not regular show that

Consider the language K ={ai bi : i in N0}. Using the fact that K is not regular show that each of the following languages is not regular.
1. W ={ai bi : i in N0, i 6=7}
2. X ={ai bi : i in N0, i 6=7}\cup ba
3. Y ={ai+3 bi : i in N0}
4. Z ={(ab)j ai bi : i, j in N0, i >=2}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

Consider the language K = {a i b i : i N 0 }. Using the fact that K is not regular show that each of the following languages is not regular. 1. W = { a i b i : i N 0 } {a 5 b 5 } 2. X = { a i b i : i...

Q:

Show that the language is not context free, USING CLOSURE PROPERTIES ONLY 6 pts - Show that the language L - {xSy : x, yinsa,b^*, x a substring of y} is not context free *using closure properties...

Q:

1 . [ 4 marks ] Convert the following CFG into Chomsky normal form using the steps outlined in the lecture notes. Clearly show each step of the process. S ASA | B A aB | aaaB B Bb | epsilon 2 . [ 4...

Q:

4. Textbook page 63: 2.1a, 2.5, 2.6 2.1 Given the FSM shown, (a) draw the state diagram (final state: 3) For each string, is it accepted: aaaaa, bbbbb, ababa, babab, abbbb Also: Describe in English...

Q:

1 (10 points) Let S = {0,1}. Use the method discussed in class to construct an NFA where its language is expressed by the regular expression (0U 1)*1. Note that you must construct a series of NFAs...

Q:

Problem 4 Suppose L U L2 is regular and L is finite. Show that La is regular Hint: you might want to express L2 as a combination of set operations over L1 UL2 and L1 Problem 5 In the class, we have...

Q:

5. (10 Points) In this question you will show that DFAs and NFAs are extremely limited as computing devices. They cannot even compute multiplication and iterated exponen tiation (although it is easy...

Q:

Problem 5 In the class, we have shown that L = {any: n > 0} is not regular. Use the pumping lemma to show that L3 = {a"ben : n 2 0, k n) is not regular. Can you prove by a simpler way using...

Q:

USE CLOSURE PROPERTIES!! 6 pts -Show that the language L = {rSy : x,yin(a,b)',x a substring of y} is not context free *using closure properties only*. Use the fact that CFLs are closed under: union,...

Q:

Problem 2 . ( NFAs ) ( 3 0 points ) Show that the following languages are regular by giving non - deterministic finite automata ( NFA ) that accept them: ( i ) Consider the English alphabet \ Sigma =...

Q:

On January 1, 20X1 LOL Corporation purchased 70 % interest in SAS Corporation for P120,000, when its capital stock and retained earnings were P60,000 and P40,000 respectively. The assets and...

Q:

Krass Snowboard Mfg. Inc. manufactures snowboards. Its cost of making 1,800 bindings is as follows: Direct materials....................................................................... $17,520...

Q:

4. Solve the following problem by dynamic programming: Maximize Z=2x+5x+3x subject to x1 + x2 + x = 8 where X1, X2, X3 are non-negative integers.

Q:

What amount must be invested today so that it will be worth R20 000, 5 years from now. You will earn 7% interest per annum on the amount. Select only the closest correct option from the following (A,...

Q:

16. If you have very little power in an organization, then there is basically nothing you can or should do about it.

Q:

Was the person thoughtful about the alternatives, and did he or she make a reasonable and appropriate choice given the information available?

Q:

17. Gaining power often involves making friends rather than making enemies in the organization.