Exercise 1. A set W of strings of symbols is defined recursively by a, b, and d belong to W. If x belongs to W, so does a(x)d. Provide 3 strings made of 3 letters each belonging to W and show the procedure used to obtain them. Provide 3 strings made of at least 5 letters each belonging to W and show the procedure used to obtain them.

Exercise 1. A set W of strings of symbols is defined recursively by a, b, and d belong to W. If x belongs to W, so does a(x)d. Provide 3 strings made of 3 letters each belonging to W and show the procedure used to obtain them. Provide 3 strings made of at least 5 letters each belonging to W and show the procedure used to obtain them.

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 17PE

See similar textbooks

Similar questions

Give a recursive deﬁnition for the set of all strings of a’s and b’s where all the strings are of odd lengths. (Assume, S is set of all strings of a’s and b’s where all the strings are of odd lengths. Then S = { a, b, aaa, aba, aab, abb, baa, bba, bab, bbb, aaaaa, ... )
Give a recursive definition for the set of all strings of a’s and b’s that begins with an a and ends in a b. Say, S = { ab, aab, abb, aaab, aabb, abbb, abab..} Let S be the set of all strings of a’s and b’s that begins with a and ends in a b. The recursive definition is as follows – Base:... Recursion: If u ∈ S, then... Restriction: There are no elements of S other than those obtained from the base and recursion of S.
Q.No.3 (a) Define through recursive definition , The language L of strings that start and end with different latters and also must contain aa in middle of each string, defined over Σ={a,b,c}. also Write at least 2 Valid and 2 Invalid strings belongs to this language (2+2) (b) Write the Regular expression for the language which accept no pair of consecutive a’s over Σ ={a,b} (1+1+1) i.R.E= ______________ (1) ii.3 Valid strings= _______________(1) iii.3 Invalid strings= _________________(1) (c) Construct a DFA which accepts all strings over Σ ={a,b} in which second last symbol is a and last symbol is b. also Write at least 2 Valid and 2 Invalid strings for the designed DFA.
Let ∑={a,b} and T be the set of words in ∑* that have no consecutive a’s (i.e. there cannot be 2 or more a’s in a row). (a) Give a recursive definition for the set T. (b) Use your recursive definition to show that the string “abbaba” is in T. (c) Is your recursive definition uniquely determined? Explain why or why not.
Recursively define the set P of strings (composed of lowercase letters) that have an even number of each vowel (i.e. a word with 2 a's and 4 e's is valid but not 1 a and 5 e's). Use set A to represent all alphabet characters, set V to represent all vowels.
A set SS of strings of characters is defined recursively by aa and bb belong to SS . If xx belongs to SS , so does xbxb . Which one of the following strings belong to SS ? this is the Group of answer choices 1. aba 2. bbbbb 3. ab 4. aaab 5. a
For function log, write the missing base case condition and the recursive call. This function computes the log of n to the base b. As an example: log 8 to the base 2 equals 3 since 8 = 2*2*2. We can find this by dividing 8 by 2 until we reach 1, and we count the number of divisions we make. You should assume that n is exactly b to some integer power. Examples: log(2, 4) -> 2 and log(10, 100) -> 2 public int log(int b, int n ) { if <<Missing base case condition>> { return 0; } else { return <<Missing a Recursive case action>> }}
Give a brief summary of three forms of recursion, each of which uses a different strategy to reach recursion termination.
Develop the desktop proof of the following recursive exercise with V = [3,5,2,7] and num = 4 (Logically without the use of programs)
Give a recursive definition of the following set of ordered pairs of positive integers: S = {(a, b)| (a is element of positive integer), (b is an integer multiplied by 3)}
Use recursive definition Define the language L, in which all words contain only 2 b’s but any number of a’s
Define through recursive definition , The language L of strings that start and end with different latters and also must contain aa in middle of each string, defined over Σ={a,b,c}. also Write at least 2 Valid and 2 Invalid strings belongs to this language