Computation and Automata
Series: Encyclopedia of Mathematics and its Applications; 25;
- Publisher's listprice GBP 134.00
-
67 817 Ft (64 588 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 20% (cc. 13 563 Ft off)
- Discounted price 54 254 Ft (51 670 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
67 817 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
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 Cambridge University Press
- Date of Publication 23 May 1985
- ISBN 9780521302456
- Binding Hardback
- No. of pages300 pages
- Size 234x162x22 mm
- Weight 573 g
- Language English 0
Categories
Short description:
In this 1985 book, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science.
MoreLong description:
In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.
MoreTable of Contents:
Editor's statement; Foreword G. Rozenberg; Acknowledgements; 1. Introduction: models of computation; 2. Rudiments of language theory; 3. Restricted automata; 4. Turing machines and recursive functions; 5. Famous decision problems; 6. Computational complexity; 7. Cryptography; 8. Trends in automata and language theory; Historical and bibliographical remarks
More
