Articoli correlati a Theory of Computation: Formal Languages, Automata,...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
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
Dalla quarta di copertina
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
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditorePearson College Div
- Data di pubblicazione1989
- ISBN 10 0805301437
- ISBN 13 9780805301434
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero edizione1
- Numero di pagine320
- Contatto del produttorenon disponibile
Risultati della ricerca per Theory of Computation: Formal Languages, Automata,...
Foto dell'editore
Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science)
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo Z1-C-057-02918
Quantità: 1 disponibili
Foto dell'editore
Theory of Computation : Formal Languages, Automata, and Complexity
Da: Better World Books Ltd, Dunfermline, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Codice articolo GRP94591476
Quantità: 1 disponibili
Foto dell'editore
Theory of Computation: Formal Languages, Automata, and Complexity
Da: Anybook.com, Lincoln, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 5580880
Quantità: 1 disponibili
Foto dell'editore
Theory of Computation : Formal Languages, Automata, and Complexity
Da: Better World Books, Mishawaka, IN, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Codice articolo GRP94591476
Quantità: 1 disponibili
Foto dell'editore
Theory of Computation: Formal Languages, Automata, and Complexity
Da: Ammareal, Morangis, Francia
Valutazione del venditore 5 su 5 stelle
Softcover. Condizione: 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. Codice articolo E-577-931
Quantità: 1 disponibili
Immagini fornite dal venditore
Theory of Computation: Formal Languages, Automata, and Complexity
Editore:
Benjamin Cummings, Redwood City, California, U.S.A., 1989
ISBN 10: 0805301437
ISBN 13: 9780805301434
Antico o usato
Rilegato
Da: Goulds Book Arcade, Sydney, Newtown, Sydney, NSW, Australia
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Good. Condizione sovraccoperta: 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. Codice articolo 166780
Quantità: 1 disponibili