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.
Search results for Theory of Computation: Formal Languages, Automata,...
Stock Image
Theory of Computation: Formal Languages, Automata, and Complexity
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0805301437I5N00
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. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Seller Inventory # 941086-6
Stock Image
Theory of Computation: Formal Languages, Automata, and Complexity
Published by
The Benjamin/Cummings Publishing Company Inc, 1989
ISBN 10: 0805301437
ISBN 13: 9780805301434
Used
Hardcover
First Edition
Seller: Chapter 1, Johannesburg, GAU, South Africa
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. No Jacket. First Edition. Heavy book may require extra postage unless posted within South Africa. The boards are a little shelf rubbed and the edges are slightly scuffed. There is some insect damage to the top edge of the front free end paper page. Internally the pages are slightly 'browned' around the edges, the pages remain neat, clean and complete. All pages are accessible. The binding is secure. GK. Our orders are shipped using tracked courier delivery services. Seller Inventory # 6rsfs
Buy Used
US$ 35.00
US$ 28.03 shipping
Ships from South Africa to U.S.A.
Ships from South Africa to U.S.A.
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
Buy Used
US$ 106.88
US$ 25.00 shipping
Ships from Australia to U.S.A.
Ships from Australia to U.S.A.
Quantity: 1 available