Arbib M.A., Kfoury A.J., Moll R.N. A Basis for Theoretical Computer Science

формат pdf
размер 8.51 МБ
добавлен 15 октября 2011 г.

Издательство Springer, 1981, -228 pp.
Классическая книга по основным понятиям алгоритмов, дискретной математики и теоретического программирования. Рассмотрены основные объекты и алгоритмы. Рассчитана на читателей с базовой математической подготовкой.
Sets, Maps, and Relations.
nduction, Strings, and Language.
Counting, Recurrences, and Trees.
Switching Circuits, Proofs, and Logic.
Binary Relations, Lattices, and Infinity.
Graphs, Matrices, and Machines.

Похожие разделы

Смотрите также

Drmota M., Flajolet P., Gardy D., Gittenberger B. (editors) Mathematics and Computer Science III: Algorithms, Trees, Combinatirics and Probabilities

формат djvu
размер 5.34 МБ
добавлен 13 января 2011 г.

Birkh?user Basel, 2004. - 554 pages. This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers...

Feil T., Krone J. Essential Discrete Math for Computer Science

формат pdf
размер 8.91 МБ
добавлен 19 января 2011 г.

Prentice Hall, 2002. - 216 Pages. This book introduces readers to the mathematics of computer science and prepares them for the math they will encounter in other college courses. It includes applications that are specific to computer science, helps learners to develop reasoning skills, and provides the fundamental mathematics necessary for computer scientists. Chapter topics include sets, functions and relations, Boolean algebra, natural numbers...

Haggard G., Schlipf J., Whitesides S. Discrete Mathematics for Computer Science

формат pdf
размер 25.96 МБ
добавлен 01 января 2011 г.

Brooks Cole, 2005. - 718 Pages. Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mat...

Hromkovi? J. Theoretical Computer Science. Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

формат djvu
размер 5.94 МБ
добавлен 31 января 2012 г.

Издательство Springer, 2004, -318 pp. This textbook is an introduction to theoretical computer science with a focus on the development of its algorithmic concepts. It is based on a substantially extended translation of the German textbook "Algorithmische Konzepte der Informatik" written for the first introductory course to theoretical fundamentals of computer science at the University of Aachen. The topics have been chosen to strike a balance be...

Ito M. Automata, Formal Languages and Algebraic Systems

формат pdf
размер 1.69 МБ
добавлен 18 октября 2011 г.

World Scientific Publishing Company, 2010. - 248 pages. This volume consists of papers selected from the presentations at the workshop and includes mainly recent developments in the fields of formal languages, automata theory and algebraic systems related to the theoretical computer science and informatics. It covers the areas such as automata and grammars, languages and codes, combinatorics on words, cryptosystems, logics and trees, Grobner ba...

Malik D.S., Sen M.K. Discrete Mathematical Structures: Theory and Applications

формат djvu
размер 13.2 МБ
добавлен 20 марта 2011 г.

Course Technology Inc, 2004. - 906 pages. Discrete Mathematical Structures teaches students the mathematical foundations of computer science, including logic, Boolean algebra, basic graph theory, finite state machines, grammars, and algorithms. This required class for Computer Science students helps them understand mathematical reasoning for reading, comprehension, and construction of mathematical arguments.

McEvoy K., Tucker J.V. Theoretical Foundations of VLSI Design

формат djvu
размер 3.02 МБ
добавлен 02 февраля 2012 г.

Издательство Cambridge University Press, 1990, -443 pp. The development of VLSI fabrication technology has resulted in a wide range of new ideas for application specific hardware and computer architectures, and in an extensive set of significant new theoretical problems for the design of hardware. The design of hardware is a process of creating a device that realises an algorithm, and many of the problems are concerned with the nature of algorith...

McNaughton R. Elementary Computability, Formal Languages, and Automata

формат djvu
размер 3.4 МБ
добавлен 24 августа 2011 г.

Prentice Hall, 1982. - 417 Pages. This book is an introduction to theoretical computer science emphasizing two interrelated areas: the theory of computability (how to tell whether problems are algorithmically solvable) and the theory of formal languages (how to design and use special languages, as for algorithms). Automata (idealized computer devices) are used as precise models of computation in studies that have actual computers as their primar...

Savage J.E. Models of Computation. Exploring the Power of Computing

формат pdf
размер 4.2 МБ
добавлен 28 октября 2011 г.

Издательство Addison-Wesley, 1998, -699 pp. Theoretical computer science treats any computational subject for which a good model can be created. Research on formal models of computation was initiated in the 1930s and 1940s by Turing, Post, Kleene, Church, and others. In the 1950s and 1960s programming languages, language translators, and operating systems were under development and therefore became both the subject and basis for a great deal of...

Van Steen M. Graph Theory and Complex Networks: An Introduction

формат pdf
размер 5.02 МБ
добавлен 02 ноября 2011 г.

Maarten van Steen, 2010. - 300 pages. Maarten van Steen is full professor at the Computer Science department of VU University Amsterdam, The Netherlands. He mainly teaches in the field of distributed systems, computer networks, and operating systems. Together with Andrew Tanenbaum he has co-authored a well-known textbook on distributed systems. Confronted with the difficulties that undergraduates in computer science have with mathematics, he se...