Professional Documents
Culture Documents
Chapter 14 Practice Test
Chapter 14 Practice Test
INSTRUCTIONS: Answer each question below. Once you finish taking the test, check
the answers provided in the Answer Key at the end of this test.
For exercises 2 through 8, Let M be the DFA given by Q = {q0, q1, q2}, = {0, 1}, q0 is
the initial state, F = { q2}, and is given by
9. Let A = {w | w {0, 1}* , w has finite length, and w ends in 110}. Is A a regular
language?
A: yes, since L(M) = A
B: no, since L(M)
C: cannot be determined
D: none of the above
10. Let M be a DFA with n states. If L(M) , then there is string w in L(M) such
that the length of w is
11. Let M be a DFA with n states. If L(M) is infinite then there is a string w in L(M)
such that the length of w, |w|, is
A: n |w| < 2n
B: n < |w| < 2n
C: n < |w| 2n
D: none of the above
13. Let M be the NDFA (Q, , q0, , F) and w *. Then w is accepted by M
provided
A: * (q0, w) F =
B: F * (q0, w)
C: * (q0, w) F
D: none of the above
14. Let M be the NDFA (Q, , q0, , F), in the corresponding DFA Md = (Qd, , q0d,
d , Fd) what is Qd equal to?
A: Q
B: F
C: the power set of Q
D: none of the above
15. Let M be the NDFA (Q, , q0, , F), in the corresponding DFA Md = (Qd, , q0d,
d, Fd) what is Fd equal to?
16. Let M be the NDFA (Q, , q0, , F), let the corresponding DFA Md = (Qd, ,
q0d, d, Fd) then
A: L(Md) L(M)
B: L(Md) = L(M)
C: L(M) L(Md)
D: none of the above
For exercises 18 through 21, Let M be the FSM given by M = (Q, , , q0, , ),
where Q = {q0, q1, q2}, = = {0,1}, and and are given below
For exercises 24 through 30, Let M be the DFA whose transition diagram is
1. C 2. B 3. C 4. A 5. C 6. A 7. C 8. D 9. A 10. A
11. A 12. C 13. C 14. C 15. D 16. B 17. A 18. A 19. B 20. C
21. A 22. A 23. B 24. A 25. B 26. A 27. C 28. A 29. D 30. D