#write a function `has_more_zs` to determine which of two strings contains # more instances of the letter "z". it should take as parameters two string # variables, and return the argument which has more occurances of the letter "z" # if neither phrase contains the letter "z", it should return: # "neither string contains the letter z." # if the phrases contain the same number of "z"s, it should return: # "the strings have the same number of zs." # the function must work for both capital and lowercase "z"s.

Show that there is a language a ⚆ {0, 1} â— with the following properties: 1. for all x â a, |x| ≤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you don’t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there aren’t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.

Which excel file extension stores automated steps for repetitive tasks?

Visually impaired individuals generally rely on the for navigation. thus, designers need to ensure that mouse-specific inputs, such as pointing, clicking, and hovering, can be done without a mouse.