Items related to Theory of Computation: Formal Languages, Automata,...
Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
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
From the Back Cover
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
"About this title" may belong to another edition of this title.
- PublisherPearson
- Publication date1989
- ISBN 10 0805301437
- ISBN 13 9780805301434
- BindingPaperback
- LanguageEnglish
- Edition number1
- Number of pages320
Search results for Theory of Computation: Formal Languages, Automata,...
Stock Image
Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science)
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # Z1-C-057-02918
Quantity: 1 available
Stock Image
Theory of Computation : Formal Languages, Automata, and Complexity
Seller: Better World Books Ltd, Dunfermline, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP94591476
Quantity: 1 available
Stock Image
Theory of Computation: Formal Languages, Automata, and Complexity
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 5580880
Quantity: 1 available
Stock Image
Theory of Computation : Formal Languages, Automata, and Complexity
Seller: Better World Books, Mishawaka, IN, U.S.A.
Seller rating 5 out of 5 stars
Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP94591476
Quantity: 1 available
Stock Image
Theory of Computation: Formal Languages, Automata, and Complexity
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Softcover. Condition: Très bon. Ancien livre de bibliothèque. Edition 1989. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1989. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-577-931
Quantity: 1 available
Seller Image
Theory of Computation: Formal Languages, Automata, and Complexity
Published by
Benjamin Cummings, Redwood City, California, U.S.A., 1989
ISBN 10: 0805301437
ISBN 13: 9780805301434
Used
Hardcover
Seller: Goulds Book Arcade, Sydney, Newtown, Sydney, NSW, Australia
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. Dust Jacket Condition: 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. Seller Inventory # 166780
Quantity: 1 available