support Remaining Time: 1 hour, 47 minutes, 03 seconds. Question Completion Status: QUESTION 61 Given language (a"b" m,
Posted: Sat May 14, 2022 4:46 pm
- Support Remaining Time 1 Hour 47 Minutes 03 Seconds Question Completion Status Question 61 Given Language A B M 1 (21.33 KiB) Viewed 47 times
- Support Remaining Time 1 Hour 47 Minutes 03 Seconds Question Completion Status Question 61 Given Language A B M 2 (21.54 KiB) Viewed 47 times
- Support Remaining Time 1 Hour 47 Minutes 03 Seconds Question Completion Status Question 61 Given Language A B M 3 (28.68 KiB) Viewed 47 times
- Support Remaining Time 1 Hour 47 Minutes 03 Seconds Question Completion Status Question 61 Given Language A B M 4 (25.21 KiB) Viewed 47 times
- Support Remaining Time 1 Hour 47 Minutes 03 Seconds Question Completion Status Question 61 Given Language A B M 5 (28.41 KiB) Viewed 47 times
- Support Remaining Time 1 Hour 47 Minutes 03 Seconds Question Completion Status Question 61 Given Language A B M 6 (25.72 KiB) Viewed 47 times
- Support Remaining Time 1 Hour 47 Minutes 03 Seconds Question Completion Status Question 61 Given Language A B M 7 (31.53 KiB) Viewed 47 times
QUESTION 62 Given the following string function for strings over the alphabet (a, b) f(x) = xy, where y is the reverse of its recursive definition is given as follows. What is the missing part of this recursive definition? f(x) = if x=A then Aelse A head(xf(tai(x)) OB head(x)tallx Mailhead(x) C head[x]f(tax/head(x) D. ftall(x)head(x) QUESTION 63 Which is a correct grammar for the following language over the alphabet A = { 0, 1) L= (#, #1, 00 11, 000# 111,..., pH1", } OAS-501 OBS-018 OCS - ISO ODS - OSIM
QUESTION 64 Given following grammar. SABA AaAa BbBA. Which of the following is a correct leftmost derivation for the string aaabba. O A SABa Abba Abba Abba Abba -- aaAbbaaaabba OB. SABa Ba aa BaaaaABaaaaa aaabba - aaabbba aaabba OC. SABa ABa ABa aaaBa - aaabba =&vBorraaabba D.S - ABS ABa Ba aaaa aaabba aaabbbaaaabba QUESTION 65
QUESTION 65 Given the following graph: b & br Which of the following is a correct depth-first search of the graph that starts at a and ends at g. O A. abcefdhg OB. abcdherg O C. abcdefg O D.abcfendg
QUESTION 66 1 points Given the following grammar, what is the language? Sabsc O A. (e. cab, cuabb, canabbb...., cab...) O B. (c.abc, ababc, abababc,..(ab)"c.... Occ, abc, aabbc, aaabbbc.c...) OD. (c, cah, cabah, cababab,....cab)"....) - 1 points QUESTION 67 Let Land M be two languages with grammars that have start symbols A and B, respectively, and with disjoint sets of nonterminals. Which of the following rules is a correct rule for constructing a grammar for a combined language? O ALM has a grammar starting with S-A1B OB.Lu M has a grammar starting with S - AB OC.Lhas a grammar starting with S-ASIA O D.L' has a grammar starting with S-SAIA
QUESTION 68 1 points Given the following grammars, which one is ambiguous? OAS - abs OBS-Saba OCSSababs ODS -- abSab QUESTION 69 1 points The following grammar is ambiguous. Which is a correct proof that the grammar is ambiguous by giving two distinct derivations for string a%b%a2 S - S%Salb OASS%S S%S%S-a%S%Sa%b%8a%b%a; S-S%S-S%a-S%S%a --S%b%aa%b%a OBS-S%S - S%S%S-a%S%S-a%%+a%b%a: SS%S-a%a%S%Sa%b%S +a%b%a OCS-S%S-S%S%S S%S%a-S%b%aa%b%a; SS%S-S%a5%S%a-S%b%aa%eb%a OD, either B or C above SARA
7373770-37, S S%S - S%a - S%S%a - S%b%a--a%b%a OBS-S%S S%S%S-a%S%Sa%b%S-a%b%a; SS%S-a%S-a%S%S -a%b%S-a%b%a OCS-S%S-S%S%S S%S%a - S%b%aa%b%a: S-S%S-S%a-S%S%a --S%b% aa%b%a O D. either B or C above QUESTION 70 Find an inductive definition for set S = {....-7,-4,-1,2,5, 8. ...). Assume the basis is: 2 € S give the induction rule. O A. if x € S then 3 X XES O B. if x € S then x + 3 € S O C. if x € S then x - 3 € S O D. if x € S then x + 3 € S