Consider the language S*, where S = {aa abba bbaa}. Which one of the following words...
Consider the language S*, where S = {aa abba bbaa}. Which one of the following words is not in the language?
1. abbaaa
2. bbaabba
3. aabbaaaa
4. abbabbaaabba
Homework Answers
Answer:-
From the given data we can say that option 2 is not
in the language
i.e; (2) bbaabba
Clarification:-
We know that all other strings are in S*(means those are generated
by aa abba bbaa)
then,
abbaaa = abba aa
aabbaaaa = aa bbaa aa
abbabbaaabba = abba bbaa abba
For any quires please do comment in the comment box below. Hope it will helps you. Please give Thumbs Up!! Thank you for posting the question, All the best.
Add Answer to:
Consider the language S*, where S = {aa abba bbaa}. Which one of
the following words...
Consider the following grammar for a language, where a and b are called terminals while <S>,...
Consider the following grammar for a language, where a and b are called terminals while <S>, <A> and <B> are called non-terminals, where <S> is the starting entity, i.e., from which we generate strings. The goal is to generate a sequence of as
QUESTION 8 For the following equation, solve for the language L. {a, aa, ab} L =...
QUESTION 8 For the following equation, solve for the language L. {a, aa, ab} L = {ab,aab,abb, aa aaa, aba} O L = {bb,aa,a} O L = {b,a} O L = {b,aa} L = {4,b,a} QUESTION 9 Consider the regular expression (a+ab)*(b+ab)* Which of the followings
4. Consider the following context-free grammar S SSSS a (a) Show how the string aa+a* can...
4. Consider the following context-free grammar S SSSS a (a) Show how the string aa+a* can be generated by this grammar (b) What language does this grammar generate? Explain
2. Find a CFG for the language of words, over alphabet 2 - (a,bl, where th...
2. Find a CFG for the language of words, over alphabet 2 - (a,bl, where th two letters are different from the last two letters (first two letters are the same, likewise last two letters are the same), i.e. if it start with aa it will end with bb and vice versa. (10 points) first
= {a,b}: 1. (9 pts) Consider the following three languages, all subsets of S* where •...
= {a,b}: 1. (9 pts) Consider the following three languages, all subsets of S* where • L = {w w is a word such that we is divisible by 3). . L2 = {w w is a word whose length is divisible by 4 }. • L3 = {w w is a word such that wla >3}. (a) For each language construct a DFA that recognizes that language. (b) Construct an automaton that recognizes Lin L2. If the constructed automaton...
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...
et l(a) be the language generated by g(a) - (n, 2, s, p) where 2 -...
et l(a) be the language generated by g(a) - (n, 2, s, p) where 2 - [a, b), n= {s,x) and s->axb ... Question: Let L(a) be the language generated by G(a) - (N, 2, S, P) where 2 - [a, b), N= {S,X) and S->aX... Let L(a) be the language generated by G(a) - (N, 2, S, P) where 2 - [a, b), N= {S,X) and S->aXb X->aX|bX|epsilon (i) (3 marks) Describe the language L(a). (First generate a few...
Consider the following grammar (S, A, B, and C are nonterminal symbols; S is the start...
Consider the following grammar (S, A, B, and C are nonterminal symbols; S is the start symbol; 0 and 1 are terminal symbols): S → AA A → BCB B → B0 | B1 | 0 | 1 C → 00 | 11 Which of the following sentences are in the language generated by the grammar? Show derivations for the sentences that can be generated. If a sentence cannot be generated by the grammar, explain why. a) 10010001 b) 01101101...
What language does the grammar below generate? S rightarrow abS | aA A rightarrow aA |...
What language does the grammar below generate? S rightarrow abS | aA A rightarrow aA | a Select the correct answer. L = {(ab)^n aaa^m: n greaterthanorequalto 0, m greaterthanorequalto 0} L = {(ab)^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 1} L = {a^n b^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 2} L = {a^n b^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 1}
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa...
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...
QUESTION 8 For the following equation, solve for the language L. {a, aa, ab} L = {ab,aab,abb, aa aaa, aba} O L = {bb,aa,a} O L = {b,a} O L = {b,aa} L = {4,b,a} QUESTION 9 Consider the regular expression (a+ab)*(b+ab)* Which of the followings
4. Consider the following context-free grammar S SSSS a (a) Show how the string aa+a* can be generated by this grammar (b) What language does this grammar generate? Explain
2. Find a CFG for the language of words, over alphabet 2 - (a,bl, where th two letters are different from the last two letters (first two letters are the same, likewise last two letters are the same), i.e. if it start with aa it will end with bb and vice versa. (10 points) first
= {a,b}: 1. (9 pts) Consider the following three languages, all subsets of S* where • L = {w w is a word such that we is divisible by 3). . L2 = {w w is a word whose length is divisible by 4 }. • L3 = {w w is a word such that wla >3}. (a) For each language construct a DFA that recognizes that language. (b) Construct an automaton that recognizes Lin L2. If the constructed automaton...
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...
What language does the grammar below generate? S rightarrow abS | aA A rightarrow aA | a Select the correct answer. L = {(ab)^n aaa^m: n greaterthanorequalto 0, m greaterthanorequalto 0} L = {(ab)^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 1} L = {a^n b^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 2} L = {a^n b^n a^m: n greaterthanorequalto 0, m greaterthanorequalto 1}
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...
Most questions answered within 3 hours.
-
I need to write a research paper and work cited about this
topic: The United States...
asked 3 minutes ago -
Hello! I was wondering if I could have some help?
If the vapor pressure of carvone...
asked 25 minutes ago -
An economist wants to estimate the mean per capita income (in
thousands of dollars) for a...
asked 44 minutes ago -
What would be the input/output characteristic of a circuit
obtained by putting two of your 2's-complementers...
asked 43 minutes ago -
In Drosophila, the transition from the syncytial blastoderm
stage to the cellular blastoderm stage is a...
asked 1 hour ago -
Project management question:
Name 3 different types of resources (hint: humans are one
type)
asked 1 hour ago -
Consider the following reaction: C 2H 2( g) + 2H 2( g) C 2H 6(
g)...
asked 1 hour ago -
Consider a 1.0 L buffer containing 0.092 mol L-1 HCOOH and 0.100
mol L-1 HCOO-. What...
asked 1 hour ago -
Koch Realty has owned a vacant land with a FMV of
$775,000 and an adjusted basis...
asked 1 hour ago -
It is estimated 29% of all adults in United States invest in
stocks and that 85%...
asked 1 hour ago -
What does a 2-sided p value of 0.04 mean? (I am not asking if it
is...
asked 2 hours ago -
A parallel-plate capacitor is made from two aluminum-foil
sheets, each 7.8 cmcm wide and 5.1 mmlong....
asked 2 hours ago