Homework Answers
answer ---> option 3 : context free but not regular
reasons:
1) regular languages are accepted by FiniteAutomata . it has very limited memory.
comparisons are not possible in finite automata. in the language definition
comparisons such as i,n >= 0 and i + n > 0 or n< 10^10 are not possible in finite automata.
so this language is not regular
**you can also use pumping lemma to prove the language is not regular
answer ---> option 3 : context free but not regular
reasons:
1) regular languages are accepted by FiniteAutomata . it has very limited memory.
comparisons are not possible in finite automata. in the language definition
comparisons such as i,n >= 0 and i + n > 0 or n< 10^10 are not possible in finite automata.
so this language is not regular
**you can also use pumping lemma to prove the language is not regular
Add Answer to:
is this right??
Choose whether the following language L3 is: R^ Finite (Regular and finite) RA...
Determining whether languages are finite, regular, context free, or recursive 1. (Each part is worth 2 points) Fill in the blanks with one of the following (some choices might not be used): a) finit...
Determining whether languages are finite, regular, context free,
or recursive
1. (Each part is worth 2 points) Fill in the blanks with one of the following (some choices might not be used): a) finite b) regular but not finite d) context-free but not deterministic context-free e) recursive (that is, decidable) but not context-free f) recursively enumerable (that is, partially decidable) but not recursive g) not recursively enumerable Recall that if M is a Turing machine then "M" (also written as...
3. For each of the following languages, . State whether the language is finite or infinite....
3. For each of the following languages, . State whether the language is finite or infinite. . State whether the language is regular or nonregular. . If you claim the language is regular: give a DFA (graphical representation) that recog- nizes the language. . If you claim that the language is not regular, describe the intuition for why this is so. Consider the following languages (a) [8 marks] The language of 8 bit binary strings that begin and end with...
9. Mark the best description (smallest language class) for each of the following lang • R...
9. Mark the best description (smallest language class) for each of the following lang • R if it is regular • C if it is context free, but not regular . N if it is "bigger than" context free You do not have to prove your answer. L = {www: we {a,b}"} L2 = {a" : n > 2, m < 5} L3 = {a"m : n + m is even } LA = {w:na(w) + no(w) = n(w)} Ls...
1. Consider the alphabet {a,b,c}. Construct a finite automaton that accepts the language described by the...
1. Consider the alphabet {a,b,c}. Construct a finite automaton that accepts the language described by the following regular expression. 6* (ab U bc)(aa)* ccb* Which of the following strings are in the language: bccc, babbcaacc, cbcaaaaccbb, and bbbbaaaaccccbbb (Give reasons for why the string are or are not in the language). 2. Let G be a context free grammar in Chomsky normal form. Let w be a string produced by that grammar with W = n 1. Prove that the...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give a DFA that accepts the language, a regular expression that generates the language, and a maximal list of strings that arc pairwise distinguishable with respect to the language. For languages that are context-free but not regular, prove that the language is not regular and either give a context- free grammar that generates the language or a pushdown automaton that accepts the language. You need...
If L1 and L2 are Regular Languages, then L1 ∪ L2 is a CFL. Group of answer choices...
If L1 and L2 are Regular Languages, then L1 ∪ L2 is a CFL. Group of answer choices True False Flag this Question Question 61 pts If L1 and L2 are CFLs, then L1 ∩ L2 and L1 ∪ L2 are CFLs. Group of answer choices True False Flag this Question Question 71 pts The regular expression ((ac*)a*)* = ((aa*)c*)*. Group of answer choices True False Flag this Question Question 81 pts Some context free languages are regular. Group of answer choices True...
Determine whether the following language is CFG(context free language) If its not prove by pumping lemma...
Determine whether the following language is CFG(context free language) If its not prove by pumping lemma L2 = { an | where n is a power of 2}
Finite state machines & Regular Expressions Please select the best option 1. For the following questions...
Finite state machines & Regular Expressions
Please select the best option
1.
For the following questions Let r, s, t be regular expressions
for the same alphabet "á" (left column). Get the property on the
right side that produces equality for each regular expression.
2.
From the diagram of the solution M = (Σ, Q, s,, F) is
respectively:
e would be NONE.
3.
The following graph corresponds to a diagram of:
A. Transition machine and states
b. Transition...
For each of the following statements. state whether it is True or False. Prove your answer:...
For each of the following statements. state whether it is True or False. Prove your answer: a. ∀L1 , L2(L1= L2)iff L1*·=L2*). b. (ØuØ*)n(¬Ø- (ØØ*)) = Ø (where ¬Ø is the complement of Ø). c. Every infinite language is the complement of a finite language. d. ∀L ((LR)R = L). e. ∀L1, L2((L1L2)*= L1*L2*). f. ∀L1, L2(( ((L1*L2*L1*)*= (L2UL1)*). g . ∀L1, L2(( ( ( L 1 U L 2 ) * = L 1 * U L 2 *...
Determine and explain whether or not the following language is context free or not: L =...
Determine and explain whether or not the following language is context free or not: L = {a^n b^j a^k b^l : n+j> k+l}. Please explain
Determining whether languages are finite, regular, context free,
or recursive
1. (Each part is worth 2 points) Fill in the blanks with one of the following (some choices might not be used): a) finite b) regular but not finite d) context-free but not deterministic context-free e) recursive (that is, decidable) but not context-free f) recursively enumerable (that is, partially decidable) but not recursive g) not recursively enumerable Recall that if M is a Turing machine then "M" (also written as...
3. For each of the following languages, . State whether the language is finite or infinite. . State whether the language is regular or nonregular. . If you claim the language is regular: give a DFA (graphical representation) that recog- nizes the language. . If you claim that the language is not regular, describe the intuition for why this is so. Consider the following languages (a) [8 marks] The language of 8 bit binary strings that begin and end with...
9. Mark the best description (smallest language class) for each of the following lang • R if it is regular • C if it is context free, but not regular . N if it is "bigger than" context free You do not have to prove your answer. L = {www: we {a,b}"} L2 = {a" : n > 2, m < 5} L3 = {a"m : n + m is even } LA = {w:na(w) + no(w) = n(w)} Ls...
1. Consider the alphabet {a,b,c}. Construct a finite automaton that accepts the language described by the following regular expression. 6* (ab U bc)(aa)* ccb* Which of the following strings are in the language: bccc, babbcaacc, cbcaaaaccbb, and bbbbaaaaccccbbb (Give reasons for why the string are or are not in the language). 2. Let G be a context free grammar in Chomsky normal form. Let w be a string produced by that grammar with W = n 1. Prove that the...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give a DFA that accepts the language, a regular expression that generates the language, and a maximal list of strings that arc pairwise distinguishable with respect to the language. For languages that are context-free but not regular, prove that the language is not regular and either give a context- free grammar that generates the language or a pushdown automaton that accepts the language. You need...
Finite state machines & Regular Expressions
Please select the best option
1.
For the following questions Let r, s, t be regular expressions
for the same alphabet "á" (left column). Get the property on the
right side that produces equality for each regular expression.
2.
From the diagram of the solution M = (Σ, Q, s,, F) is
respectively:
e would be NONE.
3.
The following graph corresponds to a diagram of:
A. Transition machine and states
b. Transition...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago