Course notes for Computability and Complexity
暂无分享，去创建一个
[1] Daniel E. Cohen,et al. Computability and Logic , 1987 .
[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[3] Christos H. Papadimitriou,et al. Elements of the Theory of Computation , 1997, SIGA.
[4] Nicholas Pippenger,et al. Theories of computability , 1997 .
[5] C. D. Walter. Algorithmics–The spirit of computing , 1988 .
[6] Henry M. Walker. The limits of computing , 1994 .
[7] J. C. Martin,et al. Introduction to Languages and the Theory of Computation" 3rd Ed , 1991 .
[8] György E. Révész. Introduction to formal languages , 1983 .
[9] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[10] Dean Kelley. Automata and formal languages: an introduction , 1995 .
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] M. F.,et al. Bibliography , 1985, Experimental Gerontology.
[13] Victor J. Rayward-Smith,et al. A first course in computability , 1986 .
[14] Jeffrey D. Ullman,et al. Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.
[15] Daniel I. A. Cohen,et al. Introduction to computer theory , 1986 .
[16] Victor J. Rayward-Smith,et al. A first course in formal language theory , 1983 .