Exercise 3: (2marks) Write RE for the language L over 2={0,1} such that all the string...

Question

Question

engineering Computer-Science

Answer 1

Answer #1

(&+0+*6+1) > Eto)* + E +1)* o (&+0* produces all strings of any lengths. Since ol shouldnt be present we we should make sure

Answer 2

Similar Homework Help Questions

Let Σ = {0,1}and deﬁne a language L over Σ as L = {0n10n10n : n...

Let Σ = {0,1}and deﬁne a language L over Σ as L = {0n10n10n : n ≥1} Show that L is not context-free. Remark: Compare this with language S1 onpage106,which is context free. Hint: Let p be the pumping constant and consider the string s = 0p10p10p. Write s as in the Pumping Lemma. Either vy has no zeros,or it has at leas tone zero;consider theses cases separately.
Give regular expressions for the following languages: (a) The language of all strings over {a,b} except...

Give regular expressions for the following languages: (a) The language of all strings over {a,b} except the empty string. (b) The language of all strings over {a,b} that contain both bab and bba as substrings. (c)L k = {w ∈ {a,b} * | w contains a substring having 3 more b’s than a’s}. (d) The language of all strings over {a,b} that have a b in every odd position (first symbol is considered position 1; empty string should be accepted)...
Prove that, if L is a regular language over the alphabet Σ=(0,1), then L': { ax...

Prove that, if L is a regular language over the alphabet Σ=(0,1), then L': { ax | x E L } is also regular for any a E Σ

John Doe claims that the language L, of all strings over the alphabet Σ = {...

John Doe claims that the language L, of all strings over the alphabet Σ = { a, b } that contain an even number of occurrences of the letter ‘a’, is not a regular language. He offers the following “pumping lemma proof”. Explain what is wrong with the “proof” given below. “Pumping Lemma Proof” We assume that L is regular. Then, according to the pumping lemma, every long string in L (of length m or more) must be “pumpable”. We...
1. L is the set of strings over {a, b) that begin with a and do...

1. L is the set of strings over {a, b) that begin with a and do not contain the substring bb. a. Show L is regular by giving a regular expression that denotes the language. b. Show L is regular by giving a DETERMINISTIC finite automaton that recognizes the language.
I need to construct a deterministic finite automata, DFA M, such that language of M, L(M),...

I need to construct a deterministic finite automata, DFA M, such that language of M, L(M), is the set of all strings over the alphabet {a,b} in which every substring of length four has at least one b. Note: every substring with length less than four is in this language. For example, aba is in L(M) because there are no substrings of at least 4 so every substring of at least 4 contains at least one b. abaaab is in...

1(a)Draw the state diagram for a DFA for accepting the following language over alphabet {0,1}: {w...

1(a)Draw the state diagram for a DFA for accepting the following language over alphabet {0,1}: {w | the length of w is at least 2 and has the same symbol in its 2nd and last positions} (b)Draw the state diagram for an NFA for accepting the following language over alphabet {0,1} (Use as few states as possible): {w | w is of the form 1*(01 ∪ 10*)*} (c)If A is a language with alphabet Σ, the complement of A is...
Problem 3.3: For a string x € {0,1}*, let af denote the string obtained by changing...

Problem 3.3: For a string x € {0,1}*, let af denote the string obtained by changing all 0's to l's and all l's to O's in x. Given a language L over the alphabet {0,1}, define FLIP-SUBSTR(L) = {uvFw: Uvw E L, U, V, w € {0, 1}*}. Prove that if L is regular, then FLIP-SUBSTR(L) is regular. (For example, (1011)F = 0100. If 1011011 e L, then 1000111 = 10(110) F11 € FLIP-SUBSTR(L). For another example, FLIP-SUBSTR(0*1*) = 0*1*0*1*.)...
1. Let £ = {0,1} and consider the language L of all binary strings of odd...

1. Let £ = {0,1} and consider the language L of all binary strings of odd length with a 0 in the middle. Give a Turing machine that decide L.

please I need it urgent thanks. subject programming language and compilers w does not contain Question...

please I need it urgent thanks. subject programming language and compilers w does not contain Question 2 Consider the following language over the alphabet = {a,b}: L = {w the substring aa} 1. What is I, the complement of L? 2. Write a regular expression for L. 3. Write a regular expression for L. 4. Design a DFA for I. 5. Modify the DFA for I to make it a DFA for L.