Verwandte Artikel zu Theory of Computation: Formal Languages, Automata,...

Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science) - Softcover

Brookshear, J. Glenn

 
9780805301434: Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science)
Softcover
ISBN 10: 0805301437 ISBN 13: 9780805301434
Verlag: Pearson Education (US), 1989

Inhaltsangabe

This book presents the foundations of theoretical computer science in a format accessible to undergraduate computer science students. Designed to serve as a text for a one-semester introductory course in the theory of computation, the book covers the traditional topics of formal languages, automata, computability, and computational complexity. In his book, Glenn Brookshear encourages students to appreciate the theoretical ideas as the foundation on which real problems are solved, rather than viewing them as unuseable abstractions. Theory of Computation covers regular, context-free, and general phrase-structure languages along with their associated automata, computability in the context of Turing machines, partial recursive functions and simple programming languages, and complexity theory with an introduction to some of the open classification problems relating to the classes P and NP.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

J. Glenn Brookshear is an Associate Professor at Marquette University. He received his Ph.D. from New Mexico State University in 1975, then was hired by Marquette to build a strong Computer Science curriculum. In addition to his highly successful Computer Science: An Overview, Brookshear has authored Theory of Computation: Formal Languages, Automata, and Complexity, also published by Addison-Wesley.



0805301437AB04062001

Von der hinteren Coverseite

This book presents the foundations of theoretical computer science in a format accessible to undergraduate computer science students. Designed to serve as a text for a one-semester introductory course in the theory of computation, the book covers the traditional topics of formal languages, automata, computability, and computational complexity. In his book, Glenn Brookshear encourages students to appreciate the theoretical ideas as the foundation on which real problems are solved, rather than viewing them as unuseable abstractions. Theory of Computation covers regular, context-free, and general phrase-structure languages along with their associated automata, computability in the context of Turing machines, partial recursive functions and simple programming languages, and complexity theory with an introduction to some of the open classification problems relating to the classes P and NP.



0805301437B04062001

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Pearson Education (US)
Erscheinungsdatum
1989
Sprache
Englisch
ISBN 10 
0805301437
ISBN 13 
9780805301434
Einband
Taschenbuch
Auflage
1
Anzahl der Seiten
320
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Riccardo Bacigalupo
riccardo.bacigalupo@sanoma.it

Sanoma Italia Via Arconati, 1 �
Milano
20135
Italien