- 1.
Construct a nondeterministic finite-state automaton that recognizes the regular set 1* ∪ 01.
- 題型：問答題
- 難易度：尚未記錄
The chromatic number of a graph is the least number of colors needed for a coloring of this graph. What is the chromatic number of the graph
- 2.
complete graph Kn,
- 題型：問答題
- 難易度：尚未記錄
The chromatic number of a graph is the least number of colors needed for a coloring of this graph. What is the chromatic number of the graph
- 3.
complete bipartite graph Km,n,
- 題型：問答題
- 難易度：尚未記錄
The chromatic number of a graph is the least number of colors needed for a coloring of this graph. What is the chromatic number of the graph
- 4.
cycle Cn, (d)
- 題型：問答題
- 難易度：尚未記錄
The chromatic number of a graph is the least number of colors needed for a coloring of this graph. What is the chromatic number of the graph
- 5.
wheel Wn,
- 題型：問答題
- 難易度：尚未記錄
The chromatic number of a graph is the least number of colors needed for a coloring of this graph. What is the chromatic number of the graph
- 6.
n-Cubes Qn.
- 題型：問答題
- 難易度：尚未記錄
- 7.
Find 3644 mod 645.
- 題型：問答題
- 難易度：尚未記錄
- 8.
Show that there exist irrational numbers x and y such that xy is rational.
- 題型：問答題
- 難易度：尚未記錄
- 9.
What is the solution of the recurrence relation an = an−1 + 2an−2 with a0 = 2 and a1 = 7
- 題型：問答題
- 難易度：尚未記錄