Question

In: Statistics and Probability

Exercise 10.11.1: Counting strings over {a, b, c}. infoAbout Count the number of strings of length...

Exercise 10.11.1: Counting strings over {a, b, c}.

infoAbout

Count the number of strings of length 9 over the alphabet {a, b, c} subject to each of the following restrictions.

(a)

The first or the last character is a.

(b)

The string contains at least 8 consecutive a's.

(c)

The string contains at least 8 consecutive identical characters.

(d)

The first character is the same as the last character, or the last character is a, or the first character is a.

(e)

The string contains at least seven consecutive a's.

(f)

The characters in the string "abababa" appear consecutively somewhere in the 9-character string. (So "ccabababa" would be such a 9-character string, but "cababcaba" would not.)

(g)

The string has exactly 2 a's or exactly 3 b's.

(h)

The string has exactly 2 a's or exactly 2 b's or exactly 2 c's

Expert Solution

ANSWER::

NOTE:: I HOPE THIS ANSWER IS HELPFULL TO YOU......**PLEASE SUPPORT ME WITH YOUR RATING......

**PLEASE GIVE ME "LIKE".....ITS VERY IMPORTANT FOR,ME......PLEASE SUPPORT ME .......THANK YOU

orchestra answered 2 years ago

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 +...

[02] For n ≥ 1, how many strings of length n using letters a,b,c are there...

[02] For n ≥ 1, how many strings of length n using letters a,b,c are there if the letter a must occur an even number of times?

S is the language over S = {a, b, c, d, e} containing all strings that...

S is the language over S = {a, b, c, d, e} containing all strings that start with at least 2 a's, followed by any number of b's, followed by 5 c's, followed by an odd number of d's, followed by an even number of e's. For example, S contains aaabbcccccdee, aaaacccccdddeeee, and so on. Write S symbolically in the manner of section 6.1, problem # 12 a) - f). Example 6.12 will also be helpful. bonus: How many strings in {000, 11}*...

Counting SortShow the B and C arrays after Counting Sort finishes on the array A [19,...

Counting SortShow the B and C arrays after Counting Sort finishes on the array A [19, 6, 10, 7, 16, 17, 13, 14, 12, 9] if the input range is 0-19.

find a recurrence relation for the number of bit strings of length n that contain the...

find a recurrence relation for the number of bit strings of length n that contain the string 10. What are the initial conditions? How many bit strings of length eight contain the string 10

(2) More inclusion-exclusion counting: How many bit strings of length 15 have bits 1, 2, and...

(2) More inclusion-exclusion counting: How many bit strings of length 15 have bits 1, 2, and 3 equal to 101, or have bits 12, 13, 14, and 15 equal to 1001 or have bits 3, 4, 5, and 6 equal to 1010? (Number bits from left to right. In other words, bit #1 is the left most bit and bit #15 is the right most bit.) Hint: The fact that the third bit appears in two of the required patterns...

I. Answer part A,B, C and D. 1a) Count the number of times a given char...

I. Answer part A,B, C and D. 1a) Count the number of times a given char occurs in a given range of a String parameter (i.e. starting at a given start index, and up to but not including and end index). If end is greater than the length of the String, then the method should stop looking at the end of the String. countCharsInRange("java", "v", 1, 2) → 0 countCharsInRange("java", "v", 0, 2) → 0 countCharsInRange("java", "v", 0, 3) →...

Question

Exercise 10.11.1: Counting strings over {a, b, c}. infoAbout Count the number of strings of length...

Solutions

Expert Solution

Related Solutions