O'Reilly logo

An Introduction to Formal Languages and Automata, 6th Edition by Linz

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

CHAPTER 14

AN OVERVIEW OF COMPUTATIONAL COMPLEXITY

CHAPTER SUMMARY

While in previous discussions on Turing machines the issue was only whether or not something could be done in principle, here the focus shifts to how well things can be done in practice. In this final chapter, we introduce the second part of the theory of computation: complexity theory, an extensive topic that deals with the efficiency of computation. We briefly describe some typical issues in complexity theory, including the role of nondeterminism.

We now reconsider computational complexity, the study of the efficiency of algorithms. Complexity, briefly mentioned in Chapter 11, complements computability by separating problems that can be solved in practice from those that can ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required