This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Editorial Reviews
Book 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.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
The basic question in the theory of computing can be formulated in any of the following ways: What is computable? Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
systolic tree automaton, operating alphabet, pushdown tape, systolic tree automata, trellis automaton, trapdoor pair, knapsack vector, homogeneous trellis automata, inverse gsm mappings, grammatical families, catenation closure, celebrated open problem, concerning number systems, inverse morphic image, speedup theorem, vector addition systems, acceptable enumeration, enumerable iff, systolic automata, knapsack systems, atomic languages, domain alphabet, accepted iff, finite deterministic automaton, trapdoor information Key Phrases - Capitalized Phrases (CAPs): (learn more)
Restricted Automata New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
The basic question in the theory of computing can be formulated in any of the following ways: What is computable? Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
systolic tree automaton, operating alphabet, pushdown tape, systolic tree automata, trellis automaton, trapdoor pair, knapsack vector, homogeneous trellis automata, inverse gsm mappings, grammatical families, catenation closure, celebrated open problem, concerning number systems, inverse morphic image, speedup theorem, vector addition systems, acceptable enumeration, enumerable iff, systolic automata, knapsack systems, atomic languages, domain alphabet, accepted iff, finite deterministic automaton, trapdoor information Key Phrases - Capitalized Phrases (CAPs): (learn more)
Restricted Automata New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 38
books:
See all 38 books this book cites
58
books
cite this book:
See all 58 books citing this book
- Language and Information by Yehoshue Bar-Hillel in Back Matter
- Computer Programming (Looking at Series) by Penny Holland in Back Matter
- The Famous History of the Life of King Henry the Eighth (Folger Library General Reader's Shakespeare) by William Shakespeare in Front Matter
- Computability and Unsolvability by Martin Davis in Back Matter
- Jewels of formal language theory by Arto Salomaa in Back Matter
See all 38 books this book cites
- Handbook of Formal Languages: Volume 1. Word, Language, Grammar by Grzegorz Rozenberg on 4 pages
- Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10 - 11, 1994. Proceedings (Lecture Notes in Computer Science) by Juliani Karhumäki on page 288, page 324, and Back Matter
- Stopping Times and Directed Processes (Encyclopedia of Mathematics and its Applications) by G. A. Edgar in Front Matter
- Combinatorial Matrix Theory (Encyclopedia of Mathematics and its Applications) by Richard A. Brualdi in Front Matter
- Computation with Finitely Presented Groups (Encyclopedia of Mathematics and its Applications) by Charles C. Sims in Front Matter
See all 58 books citing this book
Books on Related Topics
(learn more)
|
|
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
