Artículos relacionados a Theory of Computation: Formal Languages, Automata,...
Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del 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
De la contraportada
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
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Theory of Computation: Formal Languages, Automata,...
Imagen de archivo
Theory of Computation: Formal Languages, Automata, and Complexity (Benjamin/Cummings Series in Computer Science)
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: Z1-C-057-02918
Cantidad disponible: 1 disponibles
Imagen de archivo
Theory of Computation : Formal Languages, Automata, and Complexity
Publicado por
Addison Wesley, 1989
ISBN 10: 0805301437
ISBN 13: 9780805301434
Antiguo o usado
Tapa blanda
Librería: Better World Books Ltd, Dunfermline, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Nº de ref. del artículo: GRP94591476
Cantidad disponible: 1 disponibles
Imagen de archivo
Theory of Computation: Formal Languages, Automata, and Complexity
Publicado por
Benjamin Cummings, 1989
ISBN 10: 0805301437
ISBN 13: 9780805301434
Antiguo o usado
Tapa dura
Librería: Anybook.com, Lincoln, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 5580880
Cantidad disponible: 1 disponibles
Imagen de archivo
Theory of Computation : Formal Languages, Automata, and Complexity
Publicado por
Addison Wesley, 1989
ISBN 10: 0805301437
ISBN 13: 9780805301434
Antiguo o usado
Tapa blanda
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Nº de ref. del artículo: GRP94591476
Cantidad disponible: 1 disponibles
Imagen del vendedor
Theory of Computation: Formal Languages, Automata, and Complexity
Publicado por
Benjamin Cummings, Redwood City, California, U.S.A., 1989
ISBN 10: 0805301437
ISBN 13: 9780805301434
Antiguo o usado
Tapa dura
Librería: Goulds Book Arcade, Sydney, Newtown, Sydney, NSW, Australia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Good. Estado de la sobrecubierta: 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. Nº de ref. del artículo: 166780
Cantidad disponible: 1 disponibles