74,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 2-4 Wochen
payback
37 °P sammeln
  • Broschiertes Buch

Main description:
This innovative textbook presents the key foundational concepts for a one-semester undergraduate course in the theory of computation. It offers the most accessible and motivational course material available for undergraduate computer theory classes. Directed at undergraduates who may have difficulty understanding the relevance of the course to their future careers, the text helps make them more comfortable with the techniques required for the deeper study of computer science. The text motivates students by clarifying complex theory with many examples, exercises and…mehr

Produktbeschreibung
Main description:
This innovative textbook presents the key foundational concepts for a one-semester undergraduate course in the theory of computation. It offers the most accessible and motivational course material available for undergraduate computer theory classes. Directed at undergraduates who may have difficulty understanding the relevance of the course to their future careers, the text helps make them more comfortable with the techniques required for the deeper study of computer science. The text motivates students by clarifying complex theory with many examples, exercises and detailed proofs.

- This book is shorter and more accessible than the books now being used in core computer theory courses.

- Theory of computing is a standard, required course in all computer science departments.

Table of contents:
Languages and Problems. Regular Expressions and Languages. Fundamental Machines. Finite State Control Machines. Properties of Finite State Languages. Fundamental Machines. Stack and Tape Machines. Grammars. Computation Complexity. Circuit Complexity. Feasible Problems. Intractable Problems.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Autorenporträt
Raymond Greenlaw is a Professor and the Department Head in the Computer Science Department at Armstrong Atlantic State University;; he earned his Ph.D. at the University of Washington. H. James Hoover is a professor in the Department of Computing Science at the University of Alberta; he earned his Ph.D. at the University of Toronto. Both are active researchers and together have over 30 years experience in this field. Raymond Greenlaw, H. James Hoover, and Larry Ruzzo are the authors of Limits to Parallel Computation: P-Completeness Theory, Oxford University Press, 1995.