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.
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Maße
Breite: 242 mm
Dicke: 20 mm
Gewicht
ISBN-13
978-0-201-02988-8 (9780201029888)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Preliminaries.
Finite Automata and Regular Expressions.
Properties of Regular Sets.
Context-Free Grammars.
Pushdown Automata.
Properties of Context-Free Languages.
Turing Machines.
Undecideability.
The Chomsky Hierarchy.
Deterministic Context-Free Languages.
Closure Properties of Families of Languages.
Computational Complexity Theory.
Intractable Problems.
Highlights of Other Important Language Classes.
Bibliography.
Index.
