- 1.
Let I = O = {0, 1}. Please design a two-unit delay machine. That is if x ∈ I*, let x = x1x2...xm where m > 2; if s0 is the starting state, ω(s0, x) = 00x1x2...xm−2.
- 題型：問答題
- 難易度：尚未記錄
- 2.
In how many ways can one go from (0, 0) to (7, 3) if the only moves permitted are R(x, y) → (x + 1, y) and U(x, y) → (x, y + 1), and the number of U's may never exceed the number of R's along the path taken? Please justify your answer in two approaches.
- 題型：問答題
- 難易度：尚未記錄
- 3.
Let m, n be positive integers with m > n. Answer the question posed in part (a), upon replacing 7 by m and 3 by n.
- 題型：問答題
- 難易度：尚未記錄
- 4.
Let A ⊆ {1, 2, 3, …, 25} where |A| = 9. For any subset B of A let sB denote the sum of the elements in B. Prove there are distinct subsets C, D of A such that |C| = |D| = 5 and sC = sD.
- 題型：問答題
- 難易度：尚未記錄
- 5.
At the CH Company, Joan, the supervisor, has a secretary, Teresa, and three other administrative assistants. If seven accounts must be processed, in how many ways can Joan assign the accounts so that each assistant works on at least one account and Teresa's work includes the most expensive account?
- 題型：問答題
- 難易度：尚未記錄
- 6.
Prove that the following two switching networks are logically equivalence
- 題型：問答題
- 難易度：尚未記錄