![6. [5 points] Let Lo be the language over { = {0,1} consisting of strings having twice as many Os as it has l’s. For example](http://img.homeworklib.com/questions/261d4610-512c-11eb-b605-95d0d3c34aee.png?x-oss-process=image/resize,w_560)
Homework Answers
pumping lemma for regular languages:
1)assume given language is regular and there exist a finite automata with 2k states.
2)take a valid string z from L.
z=001010
3)divide the string z into 3 parts,U,V,W in such a way that |V|>=1 and |UV|<=2k
U=0010
V=1
W=0
4)if for any value of i, UVIW belongs to L then L is regular otherwise L is not regular.
say i=2 then UViW becomes 0010110 this is not belongs to L
this is contradiction to given statement.
therefore L is not regular.
Add Answer to:
6. [5 points] Let Lo be the language over { = {0,1} consisting of strings having...
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...
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...
4. Let = {0,1} and let A denote a language of strings that consist solely of...
4. Let = {0,1} and let A denote a language of strings that consist solely of zeroes, or ones. For example, strings 000 and 11 belong to A, whereas 11101 is not. a) Draw a state diagram of an NFA that recognizes A. b) How many states you need with an DFA to the same task?
(d) Let L be any regular language. Use the Pumping Lemma to show that In >...
(d) Let L be any regular language. Use the Pumping Lemma to show that In > 1 such that for all w E L such that|> n, there is another string ve L such that lvl <n. (4 marks) (e) Let L be a regular language over {0,1}. Show how we can use the previous result to show that in order to determine whether or not L is empty, we need only test at most 2" – 1 strings. (2...
DO NUMBER 4 AND 5 2. Let {acgt} and let L be the language of strings consisting of repeated copies of the pairs at, ta,...
DO NUMBER 4 AND 5
2. Let {acgt} and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg, gc. Construct both a DFSM to accept the language and a regular expression that represents the language 3. Let a,b. For a string w E X", let W denote the string w with the a's and b's flipped. For example, for w aabbab: w bbaaba wR babbaa abaabb {wwR Construct a PDA to accept...
DO NUMBER 3 2. Let {acgt} and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg, g...
DO NUMBER 3
2. Let {acgt} and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg, gc. Construct both a DFSM to accept the language and a regular expression that represents the language 3. Let a,b. For a string w E X", let W denote the string w with the a's and b's flipped. For example, for w aabbab: w bbaaba wR babbaa abaabb {wwR Construct a PDA to accept the language:...
1. Give a context-free grammar for the set BAL of balanced strings of delimiters of three...
1. Give a context-free grammar for the set BAL of balanced strings of delimiters of three types (), and . For example, (OOis in BAL but [) is not. Give a nondeterministic pushdown automata that recognizes the set of strings in BAL as defined in problem 1 above. Acceptance should be by accept state. 2. Give a context free grammar for the language L where L-(a"b'am I n>-o and there exists k>-o such that m-2*ktn) 3. Give a nondeterministic pushdown...
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. Construct a DFSM to accept the language: L w E ab): w contains at least 3 as and no more than 3 bs) 2. Let E (acgt a...
1. Construct a DFSM to accept the language: L w E ab): w contains at least 3 as and no more than 3 bs) 2. Let E (acgt and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg. ge. Construct both a DFSM to accept the language and a regular expression that represents the language. 3. Let ab. For a string w E , let w denote the string w with the...
For a string s ∈ {0, 1} let denote the number represented by in the binary * s2 s numeral system. For example 1110 in binary has a value of 14 . Consider the language: L = {u#w | u,w ∈ {0, 1} , u } ,...
For a string s ∈ {0, 1} let denote the number represented by in
the binary * s2 s numeral system. For example 1110 in binary has a
value of 14 . Consider the language: L = {u#w | u,w ∈ {0, 1} , u }
, * 2 + 1 = w2 meaning it contains all strings u#w such that u + 1
= w holds true in the binary system. For example, 1010#1011 ∈ L and
0011#100 ∈...
4. Let = {0,1} and let A denote a language of strings that consist solely of zeroes, or ones. For example, strings 000 and 11 belong to A, whereas 11101 is not. a) Draw a state diagram of an NFA that recognizes A. b) How many states you need with an DFA to the same task?
(d) Let L be any regular language. Use the Pumping Lemma to show that In > 1 such that for all w E L such that|> n, there is another string ve L such that lvl <n. (4 marks) (e) Let L be a regular language over {0,1}. Show how we can use the previous result to show that in order to determine whether or not L is empty, we need only test at most 2" – 1 strings. (2...
DO NUMBER 4 AND 5
2. Let {acgt} and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg, gc. Construct both a DFSM to accept the language and a regular expression that represents the language 3. Let a,b. For a string w E X", let W denote the string w with the a's and b's flipped. For example, for w aabbab: w bbaaba wR babbaa abaabb {wwR Construct a PDA to accept...
DO NUMBER 3
2. Let {acgt} and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg, gc. Construct both a DFSM to accept the language and a regular expression that represents the language 3. Let a,b. For a string w E X", let W denote the string w with the a's and b's flipped. For example, for w aabbab: w bbaaba wR babbaa abaabb {wwR Construct a PDA to accept the language:...
1. Give a context-free grammar for the set BAL of balanced strings of delimiters of three types (), and . For example, (OOis in BAL but [) is not. Give a nondeterministic pushdown automata that recognizes the set of strings in BAL as defined in problem 1 above. Acceptance should be by accept state. 2. Give a context free grammar for the language L where L-(a"b'am I n>-o and there exists k>-o such that m-2*ktn) 3. Give a nondeterministic pushdown...
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. Construct a DFSM to accept the language: L w E ab): w contains at least 3 as and no more than 3 bs) 2. Let E (acgt and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg. ge. Construct both a DFSM to accept the language and a regular expression that represents the language. 3. Let ab. For a string w E , let w denote the string w with the...
For a string s ∈ {0, 1} let denote the number represented by in
the binary * s2 s numeral system. For example 1110 in binary has a
value of 14 . Consider the language: L = {u#w | u,w ∈ {0, 1} , u }
, * 2 + 1 = w2 meaning it contains all strings u#w such that u + 1
= w holds true in the binary system. For example, 1010#1011 ∈ L and
0011#100 ∈...
Most questions answered within 3 hours.
-
Assume you are the HIM department representative considering EHR
adoption.
Create a logic model on how...
asked 34 seconds from now -
Identify the relation between a stock’s price and the factors
that determine the price, based on...
asked 5 minutes ago -
A psychologist determined that the number of sessions required
to obtain the trust of a new...
asked 3 minutes ago -
A
student wishes to determine the molar heat of dissolution of NaOH
in water. To do...
asked 11 minutes ago -
37.
Which of the following is an example of money serving as a
medium of exchange?...
asked 13 minutes ago -
Do you know of a leader who on the surface would appear totally
inept to lead...
asked 9 minutes ago -
What three methodologies were used to
assess gene expression? Give a brief description of
each methodology (the...
asked 22 minutes ago -
At a diffraction line phasors associated with waves from the
slits of a multiple-slit barrier: A....
asked 23 minutes ago -
summarize what you have learned about strategy in this course
and how it applies to managing...
asked 26 minutes ago -
Python help:
Given the lists, lst1 and lst2, create a new sorted list
consisting of all...
asked 27 minutes ago -
Suppose you are conducting a study with a total of 50
participants from five different regions...
asked 35 minutes ago -
If the average cost of producing 9 sweaters is $6.50 and the
marginal cost of producing...
asked 39 minutes ago