Acertain computer game is played between a human player and a computer-controlled player. every time the computer-controlled player has a turn, the game runs slowly because the computer evaluates all potential moves and selects the best one. which of the following best describes the possibility of improving the running speed of the game? a. the game’s running speed can only be improved if the game is played between two human players instead of with the computer-controlled player. b. the game’s running speed might be improved by using a process that finds approximate solutions every time the computer-controlled player has a turn. c. the game’s running speed cannot be improved because computers can only be programmed to find the best possible solution. d. the game’s running speed cannot be improved because the game is an example of an algorithm that does not run in a reasonable time.

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.

What does the https: // mean when you type in a website

Text or graphics that print at the bottom of every page are called footings footers headers headings