Problem Solving in Automata, Languages, and Complexity

Beschreibung:

Neuware - A practical introduction to essential topics at the core of computer scienceAutomata, formal language, and complexity theory are central to the understanding of computer science. This book provides, in an accessible, practically oriented style, a thorough grounding in these topics for practitioners and students on all levels.Based on the authors' belief that the problem-solving approach is the most effective, Problem Solving in Automata, Languages, and Complexity collects a rich variety of worked examples, questions, and exercises designed to ensure understanding and mastery of the subject matter. Building from the fundamentals for beginning engineers to more advanced concepts, the book examines the most common topics in the field, including:Finite-state automataContext-free grammarsTuring machinesRecursive and recursively enumerable languagesComputability theoryComplexity classesNP-completenessFocused, practical, and versatile, Problem Solving in Automata, Languages, and Complexity gives students and engineers a solid grounding in essential areas in computer science.; Sprachtheorie, Automata und Komplexitätstheorie - zentrale Themenkreise der Informatik - stehen im Mittelpunkt dieses Bandes. Zwei anerkannte Experten bieten Ihnen hier eine praxisnahe, gut lesbare und auf die Problemlösung orientierte Einführung. Durchgearbeitete Beispiele und Übungsaufgaben helfen beim Vertiefen des Stoffes. Bestandsnummer des Verkäufers 9780471439608

Diesen Artikel melden

Inhaltsangabe:

Über die Autorin bzw. den Autor:

DING-ZHU DU, PhD, is Professor of Computer Science at the University of Minnesota.

KER-I KO, PhD, is Professor of Computer Science at the State University of New York at Stony Brook. The two are also coauthors of Theory of Computational Complexity (Wiley).