Title

Login

Join

Book's by Akira Maruoka

Covers

List

Concise Guide to Computation Theory

By: Akira Maruoka

Write a review Read reviews Take a Quiz Solve Book Puzzle

Concise Guide to Computation Theory

By: Akira Maruoka

This textbook presents a thorough foundation to the theory of computation. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Topics and features: presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites; provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text; draws upon the author’s extensive teaching experience and broad research interests; discusses finite automata, context-free languages, and pushdown automata; examines the concept, universality and limitations of the Turing machine; investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness.

Average ratings

N/A

5

0%

4

0%

3

0%

2

0%

1

0%

Solve jigsaw puzzle

Age

Page Count

285

Publisher

Springer Science & Business Media

Published Date

ISBN 10

0857295357

ISBN 13

9780857295354

Concise Guide to Computation Theory

By: Akira Maruoka

Write a review Read reviews Take a Quiz Solve Book Puzzle

Concise Guide to Computation Theory

By: Akira Maruoka

This textbook presents a thorough foundation to the theory of computation. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Topics and features: presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites; provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text; draws upon the author’s extensive teaching experience and broad research interests; discusses finite automata, context-free languages, and pushdown automata; examines the concept, universality and limitations of the Turing machine; investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness.

Average ratings

N/A

5

0%

4

0%

3

0%

2

0%

1

0%

Solve jigsaw puzzle

Age

Page Count

285

Publisher

Springer Science & Business Media

Published Date

ISBN 10

0857295357

ISBN 13

9780857295354