Sale!

Languages and Machines An Introduction to the Theory of Computer Science 3rd Edition by Thomas Sudkamp 9788131714751 8131714756

Original price was: $50.00.Current price is: $35.00.

Languages and Machines An Introduction to the Theory of Computer Science 3rd Edition Thomas A. Sudkamp Digital Instant Download

Author(s): Thomas A. Sudkamp
ISBN(s): 9788131714751, 8131714756
Edition: 3
File Details: PDF, 88.85 MB
Year: 2007
Language: english
SKU: EB-7008978 Category: Tag:

Languages and Machines An Introduction to the Theory of Computer Science 3rd Edition by Thomas Sudkamp – Ebook PDF Instant Download/Delivery: 9788131714751, 8131714756

Full download Languages and Machines An Introduction to the Theory of Computer Science 3rd Edition after payment

 

Product details:

ISBN 10: 8131714756

ISBN 13: 9788131714751

Author: Thomas A. Sudkamp

The third edition of Languages and Machines: An Introduction to the Theory of Computer Science provides readers with a mathematically sound presentation of the theory of computer science at a level suitable for junior and senior level computer science majors. The theoretical concepts and associated mathematics are made accessible by a “learn as you go” approach that develops an intuitive understanding of the concepts through numerous examples and illustrations. In this edition the presentation has been enhanced by increasing the number of examples, expanding the selection of topics particularly in the area of computational complexity and providing a flexible format giving instructors the ability to design their courses that concentrate on specific areas such as automata theory, computability theory or computational complexity.

Table of contents:

Part I: Foundations

  • Chapter 1: Mathematical Preliminaries

  • Chapter 2: Languages

Part II: Grammars, Automata, and Languages

  • Chapter 3: Context-Free Grammars

  • Chapter 4: Normal Forms for Context-Free Grammars

  • Chapter 5: Finite Automata

  • Chapter 6: Properties of Regular Languages

  • Chapter 7: Pushdown Automata and Context-Free Languages

Part III: Computability

  • Chapter 8: Turing Machines

  • Chapter 9: Turing Computable Functions

  • Chapter 10: The Chomsky Hierarchy

  • Chapter 11: Decision Problems and the Church-Turing Thesis

  • Chapter 12: Undecidability

  • Chapter 13: Mu-Recursive Functions

Part IV: Computational Complexity

  • Chapter 14: Time Complexity

  • Chapter 15: P, NP, and Cook’s Theorem

  • Chapter 16: NP-Complete Problems

  • Chapter 17: Additional Complexity Classes

Part V: Deterministic Parsing

  • Chapter 18: Parsing: An Introduction

  • Chapter 19: LL(k) Grammars

  • Chapter 20: LR(k) Grammars

People also search:

machine language programs are written using

languages and machines

is assembly language and machine language the same

languages and machines 3rd edition pdf

a machine language instruction

Tags: Thomas Sudkamp, Languages, Machines, Theory