Signwork
- Publisher's listprice GBP 11.95
-
5 709 Ft (5 437 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 571 Ft off)
- Discounted price 5 138 Ft (4 893 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
5 709 Ft
Availability
Out of print
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Blackwell Publishers (Wiley)
- Date of Publication 23 March 1987
- ISBN 9780003830682
- Binding Paperback
- No. of pages pages
- Size xx0 mm
- Language English 0
Categories
Short description:
Automata and natural language theory are topics lying at the heart of computer science.
MoreLong description:
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)
More
