计算理论(第一章).pptVIP

1.4 Finite and Infinite Sets Recognizable Generatable A and B are recognizable Ex. We can write a Pascal program which, given any string w Σ*, can decide whether w in A or not A and B are generatable Ex. We can write a C++ program to enumerate all elements of A, provided we have infinite supply of paper and computing time and space. A New World of Languages All languages Finitely representable languages Regular languages Chapter 1 : Sets, Relations and Languages Elements of the theory of computation Wu Fei Wufei@cs.zju.edu.cn Department of Computer Science and Technology Examples of Special Binary Relations Finite A set A is finite, if it is equinumerous with {1,2,…,n} for some natural number n. That is to say, the cardinality of A is n. Infinite: it is not finite, such as natural number and real number. 1.4 Finite and Infinite Sets Question All infinite sets are equinumerous ? 1.4 Finite and Infinite Sets Countable and Uncountable Sets Countable A set S is countable if one of the following is true S is finite S is infinite but there is a bijection f: S?N, where N is the set of natural numbers. In other words, S is countable, if elements in S are enumerable. Countable set examples? Uncountable Sets that are not countable Georg Cantor (1845-1918) Uncountable Sets: Example Theorem: The open interval[0,1) :? {r?R| 0 ? r 1} is uncountable. Proof by diagonalization: (Cantor, 1891) Assume there is a series {ri} = r1, r2, ... containing all elements r?[0,1). Consider listing the elements of {ri} in decimal notation (although any base will do) in order of increasing index: ... Uncountability of Reals, cont’d A postulated enumeration of the reals:r1 = 0.d1,1 d1,2 d1,3 d1,4 d1,5 d1,6 d1,7 d1,8…r2 = 0.d2,1 d2,2 d2,3 d2,4 d2,5 d2,6 d2,7 d2,8…r3 = 0.d3,1 d3,2 d3,3 d3,4 d3,5 d3,6 d3,7 d3,8…r4 = 0.d4,1 d4,2 d4,3 d4,4 d4,5 d4,6 d4,7 d4,8…... Now, consider a real number generated by takingall digits di,i that lie along the diagonal in this figureand replacin