if there is an uncountable language on the alphabet ?, give an example if it does exist, and prove it if it does not.

Generate a finite automata that accpets the language generated by the following regular expression over the alphabet {x,y} by using the algorithm defined by Kleene's Theorem part 1. Extra null transitions between characters may be eliminated for simplification.  (x*y)* + (yx)*

Design FSMs that will recognise the following languages. Some of these languagesare given simply as sets of strings (and hence there should be no doubt what themachine must recognise). Others are described using English, and there may wellbe a lack of clarity in these descriptions. You should make clear any assumptionsthat you have made in interpreting what the machine needs to do. The alphabetfor all the machines is {x,y, z}.1. {xy, xz}.2. Two x symbols followed by one y and zero or more zs.3. {xxy, xzy, xy}.4. At least one x followed by exactly one y followed by zero or more zs.

(6) Fill the proper words in the following blacks: (i) The highest award in Computer Science is Award. (ii) Current silicon computer has the computation power as Turing Machine. (iii)The storage in Pushdown Machine is a Stack, and the storage in Turing Machine is a unbounded in both directions. (iv)An automata is acceptor if its output is “yes (accept)* or “no (reject)", and an automata is transducer if its output is a string of symbols. DFA or NFA is Pushdown machine is Turing machine can be and