The following questions are related to regular expression and regular language: (i) Let r,, r2, r be regular expressions. Find all the regular ones from the following expressions: a·p, r³, r* · 0, (r*)), r + r2 – r, (4) +r + 12, n+r, ÷ r,, r*), (r, r2), {rn + r2}, a+¢ (ii) Let E= {a, b}. Given regular expressions r = a*b*, r' = ba*ab* + (ab)* (ba)* and Ir" = (a* + b)b(a + b)*,- nd L(r), L(r"), and L(r"), the languages defined by r, r', r", respectively. (iii) Let E = {a, b}. Given the language L = {aam b"b, (ba)*, bb: n, m 2 0 and h 2 1}, find the regular expression r such that L(r) = L.

The following questions are related to regular expression and regular language: (i) Let r,, r2, r be regular expressions. Find all the regular ones from the following expressions: a·p, r³, r* · 0, (r)), r + r2 – r, (4) +r + 12, n+r, ÷ r,, r), (r, r2), {rn + r2}, a+¢ (ii) Let E= {a, b}. Given regular expressions r = ab, r' = baab + (ab)* (ba)* and Ir" = (a* + b)b(a + b),- nd L(r), L(r"), and L(r"), the languages defined by r, r', r", respectively. (iii) Let E = {a, b}. Given the language L = {aam b"b, (ba), bb: n, m 2 0 and h 2 1}, find the regular expression r such that L(r) = L.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 7SA

See similar textbooks

Similar questions

Let A = {a, b, c}, B = {x, y}, and C = {0, 1}.
Write the following three functions in c programming language: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true.If no such element is not found, the function returns -1.int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A.void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: Start with accumulator = A[0] For i=1...length-1 compute accumulator=f(accumulator, A[i]) Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array.int reduce(int* A, int n, int (*f)(int,int));
Let A = {b, h, s}. Draw A(r) for each regular expression r below. (iii) r3 = (sh)*
Consider the following function: void fun_with_recursion(int x) { printf("%i\n", x); fun_with_recursion(x + 1); } What will happen when this function is called by passing it the value 0?
8. Let E = {0, 1}. Compute the language of the given regular expression. (a) L(10) (b) L(ɛ +0*)
1. Determine |A|, where: {z} b. A = {{z}} _d. A = {z, {z}, {z, {z}}} _e. A = P({z}) _f. A = P({Ø,z}) a. A = _c. A = {z, {z}}
2.a Σ : {c,A,G,T}, L = { w : w = CAG™T™C, m = j + n }. For example, CAGTTC E L; CTAGTC ¢ L because the symbols are not in the order specified by the characteristic function; CAGTT ¢ L because it does not end with c; and CAGGTTC € L because the number of T's do not equal the number of A's plus the number of G's. Prove that L¢ RLs using the RL pumping theorem.
*19. A recursive function f (x), is defined as follows: if (x>100) return (x-10) else return (f (f (x+11) ) ) For which of the following values of x, (a) 100 (b) 91 f(x) (c) 1 = 91? (d) 101
Exercise: Verify the equivalence in each of the following statements. a) p^q= (p V q) b) p → q = (p → q) ^ (q → p)
Write recursive functions for the following equations:a. Harmonic number is defined by the equationb. Fibonacci numbers are defined by the formula:FN = FN-2 + FN-1, for N ≥ 2 with F0 = 0 and F1 = 1
1. Below, enter code to complete implementation of a recursive function sum allintegers(), which takes an input n and adds all integers preceding it, up to n: add all integers(n):
The function ver() is defined as follows: void ver(char "pc) { char c; if( "pc == "\O' ) return; c = "pc; ++pc; ver(pc); putchar(c); Show the output when function ver() is called as follows: ver("recursion");