Blockpy: #37.3) hot and cold a scientist has been recording observations of the temperature for the past while. on hot days, they write "h", and for cold days, they write "c". instead of using a list, they kept all of these observations in a single long string (e. g., "hch" would be a hot day, followed by a cold day, and then another hot day). write a function add_hot_cold that consumes a string of observations and returns the number of hot days minus the number of cold days. to accomplish this, you should process each letter in turn and add 1 if it is hot, and -1 if it is cold. for example, the string "hch" would result in 1, while the string "chcc" would result in -2. you cannot use the built-in count method or the len function. unit test your function.

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.

Advantages and disadvantages of binary system

17. implement the jvm dload instruction for the mic-2. it has a 1-byte index and pushes the local variable at this position onto the stack. then it pushes the next higher word onto the stack as well