Question

find the recursive definition for the set of all strings of c’s and d’s where all...

find the recursive definition for the set of all strings of c’s and d’s where all the strings have even lengths.

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Let S= set of all strings of c’s and d’s where all the strings have even lengths . Then the recursive defination of S is given by ,

Base Step :  

Recursive defination : If then .

As so x is of even length and are also length 2 two which is even and sum of two even nymber is even so are also even length strings .

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Give a recursive definition for the set of all strings of a’s and b’s where all...
Give a recursive definition for the set of all strings of a’s and b’s where all the strings are of even lengths. Please format using: 1)Base: 2) Recursion: 3)Restrictions:
Give a CFG that consists of strings where all a’s appear before b’s, all b’s appear...
Give a CFG that consists of strings where all a’s appear before b’s, all b’s appear before c’s, there are an equal number of a’s and c’s, and an even number of b’s. After construct a PDA for this CFG
give a recursive definition and write a Post system that defines the set of binary strings...
give a recursive definition and write a Post system that defines the set of binary strings of odd length that have an “x” as the middle characters, using regular expressions
Find a regular expression to describe: The set of all strings over the alphabet {a, b,...
Find a regular expression to describe: The set of all strings over the alphabet {a, b, c, d} that contain exactly one a and exactly one b So, for example, the following strings are in this language: ab, ba, cccbad, acbd, cabddddd, ddbdddacccc and the following strings are NOT in this language: a, ccbc, acbcaaacba, acacac, bcbbbbbca, aca, c, d, b
Consider a set Fn of all functions mapping n-bit strings to n-bit strings. This set is...
Consider a set Fn of all functions mapping n-bit strings to n-bit strings. This set is finite, and selecting a uniform function mapping n-bit strings to n-bit strings means choosing an element uniformly from this set. How large is Fn? For n bits mapping to m bits , what is the size of Fn?
Let A be the set of all strings of decimal digits of length five. For example...
Let A be the set of all strings of decimal digits of length five. For example 00312 and 19483 are strings in A. a. How many strings in A begin with 774? b. How many strings in A have exactly one 8? c. How many strings in A have exactly three 6’s? d. How many strings in A have the digits in a strictly increasing order? For example 02357 and 14567 are such strings, but 31482 and 12335 are not.
Let S denote the set of all possible finite binary strings, i.e. strings of finite length...
Let S denote the set of all possible finite binary strings, i.e. strings of finite length made up of only 0s and 1s, and no other characters. E.g., 010100100001 is a finite binary string but 100ff101 is not because it contains characters other than 0, 1. a. Give an informal proof arguing why this set should be countable. Even though the language of your proof can be informal, it must clearly explain the reasons why you think the set should...
A program devise a recursive algorithm to find a2n, where a is a real number and...
A program devise a recursive algorithm to find a2n, where a is a real number and n is a positive integer (hint: use the equality a2n+1 = (a^2n)^2
Give a regular expression for the set of all strings on the alphabet {0,1} with no...
Give a regular expression for the set of all strings on the alphabet {0,1} with no runs of length greater than 3(for example, no substrings 0^i or 1^i with i > 3)
How many ternary strings (strings of elements taken from the set{0,1,2}) of length2n are there in...
How many ternary strings (strings of elements taken from the set{0,1,2}) of length2n are there in which the zeroes appear only in all odd-numbered positions? How many ternary strings of length 7 will contain at least one 0?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT