Includes bibliographical references (p. 381-385) and index.
CONTENTS NOTE
Text of Note
Automata and languages. Regular languages ; Context-free languages -- Computability theory. The Church-Turing thesis ; Decidability ; Reducibility ; Advanced topics in computability theory -- Complexity theory. Time complexity ; Space complexity ; Intractability ; Advanced topics in complexity theory.