Consider the regular expressions: R1 = (a | b )* (0*1*) ( a | b )* R2 = (a | b ) (0*1*)*( a | b ) R3 = 01(R2*) Which of the following is true? A. aa ∈ L(R1) and 0101 ∈ L(R3) B. abab0101 ∈ L(R1) and ab0101a ∈ L(R2) C. a000111abab ∈ L(R1) and a01100110a ∈ L(R2) D.a010101a ∈ L(R1) and a010101a ∈ L(R2)

Q: Marked Problems. The height of a tree is the maximum number of possible nodes from the root to a…

A: Answer: we have given function height and concat_leaves and we need to complete the two function so…

Q: Sets are collections (1) without defined order and (2) not allowing duplication. Multisets, also…

A: // Here's the implementation of bag-union and bag-intersection in Racket: (define (bag-union bag1…

Q: Using dynamicarrays, implement a polynomial class with polynomial addition, subtraction, and…

A: Solution: #include <iostream>#include "polynomial.h"#include "polynomial.cpp"using namespace…

Q: Which of the followings is a representation for the set {x | a < x < b} [a,b) (a,b) (a,b] [a,b]

A: The x lies between a and b. Since there is no equal sign between a and x and even there is no equal…

Q: without defined order but which permit duplication, i.e., more than one element. We define the…

A: Given :   sum : List × List -&gt; ListThis function should take as arguments two lists representing…

Q: Closure under prefix operator. Prefix operator is defined as: prefix(w E E*) = {w1 .. wk| 0< k <…

A: Closure Under Prefix Operator. Prefix Operator Is Defined As: Prefix(W E **) = {W1 ... Wkl 03 K &lt;…

Q: If f:A->B and g:B->C, does there exist a function h:B->A such that f•k=g (composition)?

A: If there is a bijection between two sets A and B, then both sets will have the same number of…

Q: Give a description of a TM M, that recognizes language D = {w over {0, 1}*| w contains twice as many…

A: Description of Turing machine LanguageD=w over 0,1*| w contains twice as many 0's as 1's The…

Q: If Q(x) is the statement x + 1 > 2x, and the domain is the set of positive integers, which of the…

A: Given statement,  Q(x): x+1&gt;2x

Q: S is a set of strings over the alphabet {a, b}* recursively defined as: Base case: λ ∈ S, a ∈ S, b…

A: Base case: λ ∈ S, a ∈ S, b ∈ S Recursive rules: If x ∈ S, then Rule 1: axb ∈ S Rule 2: bxa ∈ S

Q: Write a function def identical(a, b) that checks whether two tuples have the same elements in any…

A: Here is the approach :  First we have to take the two tuple as the input parameters to the function…

Q: For £ = (a,b}, give a regular expression r such that L(r) = (wE £*: whas at least one pair of…

A: Defined the regular expression for the given language

Q: 1. Consider the sets: U = {A,B,C,D, E, F,G, H,I,J}, A = {A,C, E} and B = {B,C, D, F,G}. Write the…

A: Given: U={A,B,C,D,E,F,G,H,I,J} A={A,C,E}B={B,C,D,F,G}

Q: Sets are collections (1) without defined order and (2) not allowing duplication. Multisets, also…

A: Here's the implementation of bag-union and bag-intersection in Racket: (define (bag-union bag1 bag2)…

Q: Code in C++ only You are given an integer A. Let's define an infinite sequence S(A) = A%P, A²%P,…

A: Required: Write a C++ code following the given instruction which gives output the integer D(S(A)).…

Q: 10. A() { For (I = 1; I< = n; 1++) For (j =1;j< = n: j = j+i) Pf ("discrete"); }

A: Question:-

Q: This is to be done in ML coding language. Please provide the actual code, and try to keep the code…

A: The ML code is given below with output screenshot

Q: Suppose that a “word” is any string of seven letters of the alphabet, with repeated letters allowed.…

A: Given, Suppose that a “word” is any string of seven letters of the alphabet, with repeated letters…

Q: Build a PDA recognizing B = {a"b"c°| p, n, m > 0; p#2m; n is even}.

A: (1)At state q0 we push a $ as an end marker to the top of the stack and reach state q1. (2)We move…

Q: Let À ={a, b, c} and B ={a, b} a. Is A a subset of B? b. Is Ba subset of A? c. What is A U B? d.…

A: Here first of all need to find the subset. We can see that the set B contains 2 elements that are…

Q: 1. 2. Given a sequence of numbers ranging from -N to N. Remove all positive numbers from it.…

A: The python programs are given below:

Q: What is the determinant of M? M = [1 0 2;      3 8 5;      1 1 3]

A: The determinant of a matrix can be obtained by using det command in MATLAB and thus the command and…

Topological Sort

Topological sort is a sorting technique that sets up a hierarchy in a process. In this technique, when a directed network has nodes connected by arrows, the root node is placed before the successor node.