Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Computability, Complexity, And Languages Is An Introductory Text That Covers The Key Areas Of Computer Science, Including Recursive Function Theory, Formal Languages, And Automata. It Assumes A Minimal Background In Formal Mathematics. The Book Is Divided Into Five Parts: Computability, Grammars And Automata, Logic, Complexity, And Unsolvability. Computability Theory Is Introduced In A Manner That Makes Maximum Use Of Previous Programming Experience, Including A Universal Program That Takes Up Less Than A Page. The Number Of Exercises Included Has More Than Tripled. Automata Theory, Computational Logic, And Complexity Theory Are Presented In A Flexible Manner, And Can Be Covered In A Variety Of Different Arrangements.