Theoretical foundations of computer science

書誌事項

Theoretical foundations of computer science

Dino Mandrioli, Carlo Ghezzi

Wiley, c1987

  • : pbk

大学図書館所蔵 件 / 17

この図書・雑誌をさがす

注記

Bibliography: p. 459-469

Includes index

内容説明・目次

巻冊次

ISBN 9780471838340

内容説明

This new text discusses the basic concepts of theoretical computer science (formal languages, automata theory and the theory of computability) and shows their application to current programming practice. It emphasizes the practical use of theory in current, everyday programming practice and covers classical topics, semi-classical topics and less classical topics. All the basic topics of theoretical computer science are covered at an advanced undergraduate level and topics for more advanced study are explicitly marked.

目次

Mathematical Background. Models for Computer Science: Automata and Grammars. Solvable and Unsolvable Problems. The Complexity of Computing. Formal Semantics. Proving Program Properties. Nondetermination and Parallel Computation.
巻冊次

: pbk ISBN 9780471859185

内容説明

This text discusses the basic concepts of theoretical computer science (formal languages, automata theory and the theory of computability) and shows their application to current programming practice. It emphasizes the practical use of theory in current, everyday programming practice and covers classical topics, semi-classical topics and less classical topics. All of the basic topics of theoretical computer science are covered at an advanced undergraduate level and topics for more advanced study are marked.

目次

  • Mathematical Background
  • Models for Computer Science: Automata and Grammars
  • Solvable and Unsolvable Problems
  • The Complexity of Computing
  • Formal Semantics
  • Proving Program Properties
  • Nondetermination and Parallel Computation.

「Nielsen BookData」 より

詳細情報

ページトップへ