Enthusiastically reviewed by professors and successfully tested at several schools to ensure classroom effectiveness, this authoritative text skillfully integrates the discrete mathematics students of computer science need to know with the models, concepts, logic, and techniques of the field.
This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
This is an introduction to compiler design and covers topics such as context-free grammars, fine state machines, and syntax-directed translation.
Mathematical preliminaries; An introduction to compiling; Elements of language theory; Theory of translation; General parsing methods; One-pass no backtrack parsing; Limited backtrack parsing algorithms
This textbook was designed for a second course in the computer science database sequence at Stanford, and is preceded by A First Course in Database Systems, 1997. It covers the implementation of a DBMS, notably storage structure, query processing, and transaction management. Annotation c. Book News
Volume II: The New Technologies
Das Lehrbuch richtet sich an Leser mit Grundkenntnissen in Programmierung und behandelt zentrale Modelle und Konzepte der Informatik sowie die erforderlichen Grundlagen der diskreten Mathematik und Logik.
