
UNLV CSC 456/656 Fall 2008 Additional Questions for the Practice Final Exam
-
Find a minimal DFA which accepts the language described by the following
regular expression:
-
Use the CKY algorithm to decide whether the string
w
is generated by the context-free grammar
G.
-
Prove that a language is decidable if and only if it can be
enumerated in canonical order by some machine.

Back to
Course Page