pC Blog
Paskorn : This blog contains my notes about my life. Research, Reading, Learning ...
Monday, November 17, 2008
Qualification Exam Theory Part
(Fall 2008 Topics)
1) Structural Induction, Induction
2) Logically Valid of
and
in
3)
,
: context free closure
4)
is not regular
and
is context free
5) The function f(n) :the number of perfect square numbers that < n,
f(n) is Primitive Recursive
6) The set of {m |p+q, when
and
and P and Q are recursive enumerable sets } is a recursive enumerable set.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment