Question

n digit string of length n over alphabet {0,1, . . . ,9} a. How many...

n digit string of length n over alphabet {0,1, . . . ,9}

a. How many n digit strings are there with at least one 1?

b. many n digit are there with EXACTLY one 1?

PLEASE ANSWER BOTH AND INCLUDE THE FACT THAT THE STRING IS OVER ALPHABET {0,1,2,3,4....9}

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

Homework Answers

Answer #1

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
n digit string of length n over alphabet {0,1, . . . ,9} How many n...
n digit string of length n over alphabet {0,1, . . . ,9} How many n digit strings are there with at least one 1? How many n digit are there with EXACTLY one 1?
Which one of the following languages over the alphabet {0,1} is described by the regular expression...
Which one of the following languages over the alphabet {0,1} is described by the regular expression (0+1)* 0 (0+1)* 0 (0+1)* ? a.The set of all strings that begin and end with either 0 or 1 b.The set of all strings containing at most two zeros c.The set of all strings containing at least two zeros. d.The set of all strings containing the substring 00
How many different decimal strings of length 2 (strings of length two where each element of...
How many different decimal strings of length 2 (strings of length two where each element of the string is one of the decimal digits 0-9) are there where no digit can be repeated? How many length 3 decimal strings are there like this. How many length 7 decimal strings are there like this? How many length 11 decimal strings are there like this? Give an example of one of the length 11 strings.
Q2 [10 pts] Give DFA's accepting the following languages over the alphabet {0,1}: a) The set...
Q2 [10 pts] Give DFA's accepting the following languages over the alphabet {0,1}: a) The set of all strings whose 3rd symbol from the right end is a 0. b) The set of strings such that the number of 0's is divisible by 3 and the number of 1's divisible by 2.
Consider mini-alphabet made of just letters {a, b, c, d, e}. How many “words” (i.e., strings...
Consider mini-alphabet made of just letters {a, b, c, d, e}. How many “words” (i.e., strings of letters from that alphabet, whether they correspond to meaningful words or not) are there of length n, for n≥1 ? Use mathematical induction to prove your answer.
how many strings of length 14 of lower case letters from the English alphabet can be...
how many strings of length 14 of lower case letters from the English alphabet can be formed, if the first two letters cannot Abe both vowels and the last letter must be a consonant?
Do each of the following. a) How many ternary strings of length 20 contain at least...
Do each of the following. a) How many ternary strings of length 20 contain at least four 1s? (Hint: A ternary string consists of 0s, 1s, and 2s.) b) How many ternary strings of length 20 contain exactly four 1s?
Consider strings of length 8 made up of elements in {0,1}. How many strings contain 000...
Consider strings of length 8 made up of elements in {0,1}. How many strings contain 000 as a substring? How many strings contain more 0’s than 1’s?
Consider strings of length 70, in which each character is one of the letters a, b,...
Consider strings of length 70, in which each character is one of the letters a, b, c. please explain in detail. 1)How many such strings have exactly 1 letter c? please answer with detail. 2)How many such strings have exactly 12 letters c and exactly 30 letters b? 3)How many such strings have exactly 12 letters c or exactly 30 letters b? 4)How many such strings have at least 3 letters c
Let x be a string of length n, and let y be a string of length...
Let x be a string of length n, and let y be a string of length n − k, for 1 ≤ k < n. We wish to line up the symbols in x with the symbols in y by adding k blanks to y. Suppose that we add two separate blocks of blanks, one of size i and one of size k − i, for 1 ≤ i < k. How many ways are there to do this? Every...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT