5. Ternary strings. A ternary string is a word from the alphabet {0,1,2}{0,1,2}. For example, 022101022101...

5. Ternary strings. A ternary string is a word from the alphabet {0,1,2}{0,1,2}. For example, 022101022101 is a ternary string of length 6.

(a) Enumerate all ternary strings of length 2.
(b) Generalize: how many ternary strings have length r?
(c) A ternary string of length 6 is to be made. How many ways can we choose how many 0's, 1's, and 2's to include in the string?
(d) A ternary string of length 6 is to have two 0's, a 1, and three 2's. How many strings have this property?
(e) What is the probability that a ternary string of length 6 has two 0's, a 1, and three 2's?

Expert Solution

Colby Messinger answered 2 years ago

Recall that a 5-bit string is a bit strings of length 5, and a bit string...

Recall that a 5-bit string is a bit strings of length 5, and a bit string of weight 3, say, is one with exactly three 1’s. a. How many 5-bit strings are there? b. How many 5-bit strings have weight 0? c. How many 5-bit strings have weight 1? d. How many 5-bit strings have weight 2? e. How many 5-bit strings have weight 4? f. How many 5-bit strings have weight 5? g. How many 5-bit strings have weight...

Draw the NFA for language L2 = { w | w ends in 12}. Alphabet {0,1,2}

Write a program that removes a target item (a string) from a list of strings, and...

Write a program that removes a target item (a string) from a list of strings, and that will print out the list without the item. Do not use built-in functions other than input, print, and append. Instead, you may generate a new list that does not include the target item and you can use the append() function. Your program should read two inputs: the target and the list. For example, if the input is “apple” and the list is [‘berry’,...

For simplicity, you can consider DNA sequences as strings in the alphabet of {A, C, G,...

For simplicity, you can consider DNA sequences as strings in the alphabet of {A, C, G, T}. Implement a special hash table to store all short DNA segments of certain length (e.g., 20) found in a long DNA sequence. Every DNA segment is stored as a (key, value) pair, where the key is the sequence of the segment, and the value is the position of the segment in the DNA. For example given a DNA sequence of ACGTACGTTT, there are...

2. Let S be the set of strings over the alphabet Σ = {a, b, c}...

2. Let S be the set of strings over the alphabet Σ = {a, b, c} defined recursively by (1) λ ∈ S and a ∈ S; and (2) if x ∈ S, then bxc ∈ S. Recall that λ denotes the empty string which has no letters and has length 0. List all strings of S which are length at most seven. 3. Prove the following theorem by induction: For every integer n ≥ 1, 1 · 2 +...

4. Construct regular expressions for the following languages over the alphabet {a, b}: a. Strings that...

4. Construct regular expressions for the following languages over the alphabet {a, b}: a. Strings that do not begin with an “a”. b. Strings that contain both aa and bb as substrings. 5. Let ? = {? ?? ?? ? | ? > ? + ?}. a. List all strings of length 7. (use power notation: i.e. aabbbbaaaaaaaa is a2b 4a 8 ) b. Use the Pumping Lemma for Regular Languages to prove that L is not regular.

Question 3: C-Strings and pointers (10 pts) [5] The following function appends C-string str2, to C-string...

Question 3: C-Strings and pointers (10 pts) [5] The following function appends C-string str2, to C-string str1. Complete the function using array access, i.e. str1[i], but no pointer access. Note: For both part a) and part b) you may not use any library function calls (e.g. you cannot use strlen, strcat, etc.) // Append strt2 to str1 void my_strcat(char str1[], char str2[]) { //YOUR CODE HERE } // example of using my_strcat() #include <stdio.h> int main(void) { char my_str1[50] =...

write a java prog that include an array of strings of size 50 String[] strings...

write a java prog that include an array of strings of size 50 String[] strings = new String[50]; then find the max length of the inputs inside a method keep reading from the user until user enters keyword to stop input : may ala jony ram asd fgghff daniel jwana output : max length : 10

If we create a 5 digit bit string that is randomly generated, all strings equally likely......

If we create a 5 digit bit string that is randomly generated, all strings equally likely... 1. possibility of string containing three consecutive zeroes? 2. conditional probability of it containing three consecutive zeroes where first number is a one?

Suppose that you pick a bit string from the set of all bit strings of length...

Suppose that you pick a bit string from the set of all bit strings of length ten. Find the probability that the bit string has exactly two 1s; the bit string begins and ends with 0; the bit string has the sum of its digits equal to seven; the bit string has more 0s than 1s; the bit string has exactly two 1s, given that the string begins with a 1.

Question