Signwork by STEWART,;

10% KEDVEZMÉNY?
A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.

Kiadói listaár GBP 11.95
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.

5 395 Ft (5 138 Ft + 5% áfa)
Kedvezmény(ek) 10% (cc. 540 Ft off)
Kedvezményes ár 4 855 Ft (4 624 Ft + 5% áfa)

5 395 Ft

Beszerezhetőség

A kiadónál véglegesen elfogyott, nem rendelhető. Érdemes újra keresni a címmel, hátha van újabb kiadás.

A termék adatai:

Kiadó Blackwell Publishers (Wiley)
Megjelenés dátuma 1987. március 23.

ISBN 9780003830682
Kötéstípus Puhakötés
Terjedelem oldal
Méret xx0 mm
Nyelv angol

Kategóriák

Rövid leírás:

Automata and natural language theory are topics lying at the heart of computer science.

Több

Hosszú leírás:

Automata and natural language theory are topics lying at the heart of computer science. Both are linked to computational complexity and together, these disciplines help define the parameters of what constitutes a computer, the structure of programs, which problems are solvable by computers, and a range of other crucial aspects of the practice of computer science. In this important volume, two respected authors/editors in the field offer accessible, practice-oriented coverage of these issues with an emphasis on refining core problem solving skills.

A practical introduction to essential topics at the core of computer science

Automata, formal language, and complexity theory are central to the understanding of computer science. This book provides, in an accessible, practically oriented style, a thorough grounding in these topics for practitioners and students on all levels.

Based on the authors' belief that the problem-solving approach is the most effective, Problem Solving in Automata, Languages, and Complexity collects a rich variety of worked examples, questions, and exercises designed to ensure understanding and mastery of the subject matter. Building from the fundamentals for beginning engineers to more advanced concepts, the book examines the most common topics in the field, including:
* Finite-state automata
* Context-free grammars
* Turing machines
* Recursive and recursively enumerable languages
* Computability theory
* Complexity classes
* NP-completeness

Focused, practical, and versatile, Problem Solving in Automata, Languages, and Complexity gives students and engineers a solid grounding in essential areas in computer science.

"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text?" (IEEE Circuits & Devices, July/August 2004)

"...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)

"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text?" (IEEE Circuits & Devices, July/August 2004)

"...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)