Verwandte Artikel zu Theory of Computation: Formal Languages, Automata,...
Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science) - Softcover
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.
EUR 9,49
EUR 4,53 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Theory of Computation: Formal Languages, Automata,...
Beispielbild für diese ISBN
Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science)
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Bestandsnummer des Verkäufers Z1-C-057-02918
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computation: Formal Languages, Automata, and Complexity
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,800grams, ISBN:0805301437. Bestandsnummer des Verkäufers 5580880
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computation : Formal Languages, Automata, and Complexity
Anbieter: Better World Books Ltd, Dunfermline, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Bestandsnummer des Verkäufers GRP94591476
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Theory of Computation : Formal Languages, Automata, and Complexity
Anbieter: Better World Books, Mishawaka, IN, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Bestandsnummer des Verkäufers GRP94591476
Anzahl: 1 verfügbar
Foto des Verkäufers
Theory of Computation: Formal Languages, Automata, and Complexity
Verlag:
Benjamin Cummings, Redwood City, California, U.S.A., 1989
ISBN 10: 0805301437
ISBN 13: 9780805301434
Gebraucht
Hardcover
Anbieter: Goulds Book Arcade, Sydney, Newtown, Sydney, NSW, Australien
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Good. Zustand des Schutzumschlags: No Dust Jacket. The cover has a little wear. The page edges are moderately tanned and foxed, as are the first and last few pages. The page margins are somewhat tanned. 322 pages. Books listed here are not stored at the shop. Please contact us if you want to pick up a book from Newtown. Bestandsnummer des Verkäufers 166780
Anzahl: 1 verfügbar