Models of Computation and Formal Languages presents a comprehensive and rigorous treatment of the theory of computability. The text takes a novel approach focusing on computational models and is the first book of its kind to feature companion software. Deus Ex Machina, developed by Nicolae Savoiu, comprises software simulations of the various computational models considered and incorporates numerous examples in a user-friendly format.
Part I of the text introduces several universal models including Turing machines, Markov algorithms, and register machines. Complexity theory is integrated gradually, starting in Chapter 1. The vector machine model of parallel computation is covered thoroughly both in text and software. Part II develops the Chomsky hierarchy of formal languages and provides both a grammar-theoretic and an automata-theoretic characterization of each language family. Applications to programming languages round out an in-depth theoretical discussion, making this an ideal text for students approaching this subject for the first time. Ancillary sections of several chapters relate classical computability theory to the philosophy of mind, cognitive science, and theoretical linguistics.
Ideal for Theory of Computability and Theory of Algorithms courses at the advanced undergraduate or beginning graduate level, Models of Computation and Formal Languages is one of the only texts that... Â· Â· Features accompanying software available on the World Wide Web at http://home.manhattan.edu/~gregory.taylor/thcomp/ Adopts an integrated approach to complexity theory
Â· Offers a solutions manual containing full solutions to several hundred exercises. Most of these solutions are available to students on the World Wide Web at http://home.manhattan.edu/~gregory.taylor/thcomp Â· Features examples relating the theory of computation to the probable programming experience of an undergraduate computer science major