Home | Amazing | Today | Tags | Publishers | Years | Search 
A Concise Introduction to Languages and Machines (Undergraduate Topics in Computer Science)
A Concise Introduction to Languages and Machines (Undergraduate Topics in Computer Science)

This book focuses on key theoretical topics of computing, in particular formal languages and abstract machines. It is intended primarily to support the theoretical modules on a computer science or computing-related undergraduate degree scheme.

Though the book is primarily theoretical in nature, it attempts to avoid the...

Computer Algebra: Symbolic and Algebraic Computation (Computing Supplementa)
Computer Algebra: Symbolic and Algebraic Computation (Computing Supplementa)

The journal Computing has established a series of supplement volumes the fourth of which appears this year. Its purpose is to provide a coherent presentation of a new topic in a single volume. The previous subjects were Computer Arithmetic 1977, Fundamentals of Numerical Computation 1980, and Parallel Processes and Related Automata...

Formal Languages and Compilation (Texts in Computer Science)
Formal Languages and Compilation (Texts in Computer Science)

The book collects and condenses the experience of years of teaching compiler courses and doing research on formal language theory, on compiler and language design, and to a lesser extent on natural language processing. In the turmoil of information technology developments, the subject of the book has kept the same fundamental...

Parallel Complexity Theory (Research Notes in Theoretical Computers Science)
Parallel Complexity Theory (Research Notes in Theoretical Computers Science)

Parallel complexity theory, the study of resource-bounded parallel computation, is surely one of the fastest-growing areas of theoretical Computer Science. In the light of this, it would be foolish to attempt an encyclopedic coverage of the field. However, it is the belief of the author that its foundations are becoming increas ingly...

Quantum Computing
Quantum Computing

The twentieth century witnessed the birth of revolutionary ideas in the phys- ical sciences. These ideas began to shake the traditional view of the universe dating back to the days of Newton, even to the days of Galileo. Albert Ein- stein is usually identified as the creator of the relativity theory, a theory that is used to model the...

Theoretical Computer Sciences: Lectures given at a Summer School of the Centro Internazionale Matematico Estivo
Theoretical Computer Sciences: Lectures given at a Summer School of the Centro Internazionale Matematico Estivo

R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.

In this lecture we discuss a type of computer organization which is based upon the concept of operation sequencing being controlled by operand availability. Such sequencing...

Think Complexity: Complexity Science and Computational Modeling
Think Complexity: Complexity Science and Computational Modeling
This book is inspired by boredom and fascination: boredom with the usual presentation of data structures and algorithms, and fascination with complex systems. The problem with data structures is that they are often taught without a motivating context; the problem with complexity science is that it is usually not taught at...
Programming Language Concepts (Undergraduate Topics in Computer Science)
Programming Language Concepts (Undergraduate Topics in Computer Science)

Programming Language Concepts uses a functional programming language (F#) as the metalanguage in which to present all concepts and examples, and thus has an operational flavour, enabling practical experiments and exercises. It includes basic concepts such as abstract syntax, interpretation, stack machines, compilation, type checking, and...

The Correctness-by-Construction Approach to Programming
The Correctness-by-Construction Approach to Programming

The focus of this book is on bridging the gap between two extreme methods for developing software. On the one hand, there are texts and approaches that are so formal that they scare off all but the most dedicated theoretical computer scientists. On the other, there are some who believe that any measure of formality is a waste of time,...

Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations

Combining concepts of mathematics and computer science, this book is about the sequences of symbols that can be generated by simple models of computation called "finite automata". Suitable for graduate students or advanced undergraduates, it starts from elementary principles and develops the basic theory. The study then progresses...

Models and Analysis for Distributed Systems (ISTE)
Models and Analysis for Distributed Systems (ISTE)
Verification and hence modeling are a mandatory but intricate problem for engineers developing embedded distributed real-time systems that are entrusted with critical safety applications like medical care, transportation, energy production, industrial processes, military operations. Therefore, while emerging 40 years ago, first for...
Compiler Design: Syntactic and Semantic Analysis
Compiler Design: Syntactic and Semantic Analysis

While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined – ideally there exist complete precise descriptions of the source and target languages. Additional...

Result Page: 10 9 8 7 6 5 4 3 2 1 
©2024 LearnIT (support@pdfchm.net) - Privacy Policy