close
1.

図書

図書
David Gries and Fred B. Schneider
出版情報: New York ; Tokyo : Springer-Verlag, c1993  xvi, 497 p. ; 25 cm
シリーズ名: Texts and monographs in computer science
所蔵情報: loading…
2.

電子ブック

EB
David Gries, Allan Heydon, Clark Allan Heydon, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer US, 2006
所蔵情報: loading…
目次情報: 続きを見る
Preface
Introducing Vesta / Part I:
Introduction / 1:
Some Scenarios / 1.1:
The Configuration Management Challenge / 1.2:
The Vesta Response / 1.3:
Essential Background / 2:
The Unix File System / 2.1:
Naming Files and Directories / 2.1.1:
Mount Points / 2.1.2:
Links / 2.1.3:
Properties of Files / 2.1.4:
Unix Processes / 2.2:
The Unix Shell / 2.3:
The Unix Programming Environment / 2.4:
Make / 2.5:
The Architecture of Vesta / 3:
System Components / 3.1:
Source Management Components / 3.1.1:
Build Components / 3.1.2:
Storage Components / 3.1.3:
Models and Modularity / 3.1.4:
Vesta's Core Properties / 3.2:
The User's View of Vesta / Part II:
Managing Sources and Versions / 4:
Names and Versions / 4.1:
The Source Name Space / 4.1.1:
Versioning / 4.1.2:
Naming Files and Packages / 4.1.3:
The Development Cycle / 4.2:
The Outer Loop / 4.2.1:
The Inner Loop / 4.2.2:
Detailed Operation of the Repository Tools / 4.2.3:
Version Control Alternatives / 4.2.4:
Additional Repository Tools / 4.2.5:
Mutable Files and Directories / 4.2.6:
Replication / 4.3:
Global Name Space / 4.3.1:
A Replication Example / 4.3.2:
The Replicator / 4.3.3:
Cross-Repository Check-out / 4.3.4:
Repository Metadata / 4.4:
Mutable Attributes / 4.4.1:
Access Control / 4.4.2:
Metadata and Replication / 4.4.3:
System Description Language / 5:
Motivation / 5.1:
Language Highlights / 5.2:
The Environment Parameter / 5.2.1:
Bindings / 5.2.2:
Tool Encapsulation / 5.2.3:
Closures / 5.2.4:
Imports / 5.2.5:
Building Systems in Vesta / 6:
The Organization of System Models / 6.1:
Hierarchies of System Models / 6.2:
Bridges and the Standard Environment / 6.2.1:
Library Models / 6.2.2:
Application Models / 6.2.3:
Putting It All Together / 6.2.4:
Control Panel Models / 6.2.5:
Customizing the Build Process / 6.3:
Handling Large Scale Software / 6.4:
Inside Vesta / Part III:
Inside the Repository / 7:
Support for Evaluation and Caching / 7.1:
Derived Files and Shortids / 7.1.1:
Evaluator Directories and Volatile Directories / 7.1.2:
Fingerprints / 7.1.3:
Inside the Repository Implementation / 7.2:
Directory Implementation / 7.2.1:
Shortids and Files / 7.2.2:
Longids / 7.2.3:
Copy-on-Write / 7.2.4:
NFS Interface / 7.2.5:
RPC Interfaces / 7.2.6:
Implementing Replication / 7.3:
Mastership / 7.3.1:
Agreement / 7.3.2:
Agreement-Preserving Primitives / 7.3.3:
Propagating Attributes / 7.3.4:
Incremental Building / 8:
Overview of Function Caching / 8.1:
Caching and Dynamic Dependencies / 8.2:
The Function Cache Interface / 8.3:
Computing Fine-Grained Dependencies / 8.4:
Representing Dependencies / 8.4.1:
Caching External Tool Invocations / 8.4.2:
Caching User-Defined Function Evaluations / 8.4.3:
Caching System Model Evaluations: A Special Case / 8.4.4:
Error Handling / 8.5:
Function Cache Implementation / 8.6:
Cache Lookup / 8.6.1:
Cache Entry Storage / 8.6.2:
Synchronization / 8.6.3:
Evaluation and Caching in Action / 8.7:
Scratch Build of the Standard Environment / 8.7.1:
Scratch Build of the Vesta Umbrella Library / 8.7.2:
Scratch and Incremental Builds of the Evaluator / 8.7.3:
Weeder / 9:
How Deletion is Specified / 9.1:
Implementation of the Weeder / 9.2:
The Function Call Graph / 9.2.1:
Concurrent Weeding / 9.2.2:
Assessing Vesta / Part IV:
Competing Systems / 10:
Loosely Connected Configuration Management Tools / 10.1:
RCS / 10.1.1:
CVS / 10.1.2:
Integrated Configuration Management Systems / 10.1.3:
DSEE / 10.2.1:
ClearCASE / 10.2.2:
Other Systems / 10.3:
Vesta System Performance / 11:
Platform Configuration / 11.1:
Overall System Performance / 11.2:
Performance Comparison with Make / 11.2.1:
Performance Breakdown / 11.2.2:
Caching Analysis / 11.2.3:
Resource Usage / 11.2.4:
Repository Performance / 11.3:
Speed of File Operations / 11.3.1:
Disk and Memory Consumption / 11.3.2:
Speed of Repository Tools / 11.3.3:
Speed of Cross-Repository Tools / 11.3.4:
Speed of the Replicator / 11.3.5:
Function Cache Performance / 11.4:
Server Performance / 11.4.1:
Measurements of the Stable Cache / 11.4.2:
Disk and Memory Usage / 11.4.3:
Function Cache Scalability / 11.4.4:
Weeder Performance / 11.5:
Interprocess Communication / 11.6:
Conclusions / 12:
Vesta in the Real World / 12.1:
Vesta in the Future / 12.2:
SDL Reference Manual / A:
Lexical Conventions / A.1:
Meta-notation / A.2.1:
Terminals / A.2.2:
Semantics / A.3:
Value Space / A.3.1:
Type Declarations / A.3.2:
Evaluation Rules / A.3.3:
Expr / A.3.3.1:
Literal / A.3.3.2:
Id / A.3.3.3:
List / A.3.3.4:
Binding / A.3.3.5:
Select / A.3.3.6:
Block / A.3.3.7:
Stmt / A.3.3.8:
Assign / A.3.3.9:
Iterate / A.3.3.10:
FuncDef / A.3.3.11:
FuncCall / A.3.3.12:
Model / A.3.3.13:
Files / A.3.3.14:
File Name Interpretation / A.3.3.15:
Pragmas / A.3.3.17:
Primitives / A.3.4:
Functions on Type t_bool / A.3.4.1:
Functions on Type t_int / A.3.4.2:
Functions on Type t_text / A.3.4.3:
Functions on Type t_list / A.3.4.4:
Functions on Type t_binding / A.3.4.5:
Special Purpose Functions / A.3.4.6:
Type Manipulation Functions / A.3.4.7:
Tool Invocation Function / A.3.4.8:
Diagnostic Functions / A.3.4.9:
Concrete Syntax / A.4:
Grammar / A.4.1:
Ambiguity Resolution / A.4.2:
Tokens / A.4.3:
Reserved Identifiers / A.4.4:
The Vesta Web Site / B:
References
Index
Preface
Introducing Vesta / Part I:
Introduction / 1:
3.

電子ブック

EB
Fred B. Schneider, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , ACM, 1987
所蔵情報: loading…
4.

電子ブック

EB
Dexter C. Kozen, David Gries, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer London, 2006
所蔵情報: loading…
目次情報: 続きを見る
Preface
Lectures
The Complexity of Computations / 1:
Time and Space Complexity Classes and Savitch's Theorem / 2:
Separation Results / 3:
The Immerman-Szelepcsenyi Theorem / 4:
Logspace Computability / 5:
The Circuit Value Problem / 6:
The Knaster-Tarski Theorem / A:
Alternation / 7:
Problems Complete for PSPACE / 8:
The Polynomial-Time Hierarchy / 9:
More on the Polynomial-Time Hierarchy / 10:
Parallel Complexity / 11:
Relation of NC to Time-Space Classes / 12:
Probabilistic Complexity / 13:
BPP [characters not reproducible] / 14:
Chinese Remaindering / B:
Complexity of Primality Testing / C:
Berlekamp's Algorithm / D:
Interactive Proofs / 15:
PSPACE [characters not reproducible] IP / 16:
IP [characters not reproducible] PSPACE / 17:
Probabilistically Checkable Proofs / 18:
NP [characters not reproducible] PCP (n[superscript 3], 1) / 19:
More on PCP / 20:
A Crash Course in Logic / E:
Complexity of Decidable Theories / 21:
Complexity of the Theory of Real Addition / 22:
Lower Bound for the Theory of Real Addition / 23:
Lower Bound for Integer Addition / 24:
Automata on Infinite Strings and S1S / 25:
Determinization of [omega]-Automata / 26:
Safra's Construction / 27:
Relativized Complexity / 28:
Nonexistence of Sparse Complete Sets / 29:
Unique Satisfiability / F:
Toda's Theorem / G:
Circuit Lower Bounds and Relativized PSPACE = PH / 30:
Lower Bounds for Constant Depth Circuits / 31:
The Switching Lemma / H:
Tail Bounds / I:
The Gap Theorem and Other Pathology / 32:
Partial Recursive Functions and Godel Numberings / 33:
Applications of the Recursion Theorem / 34:
Abstract Complexity / J:
The Arithmetic Hierarchy / 35:
Complete Problems in the Arithmetic Hierarchy / 36:
Post's Problem / 37:
The Friedberg-Muchnik Theorem / 38:
The Analytic Hierarchy / 39:
Kleene's Theorem / 40:
Fair Termination and Harel's Theorem / 41:
Exercises
Homework 1
Homework 2
Homework 3
Homework 4
Homework 5
Homework 6
Homework 7
Homework 8
Homework 9
Homework 10
Homework 11
Homework 12
Miscellaneous Exercises
Hints and Solutions
Homework 1 Solutions
Homework 2 Solutions
Homework 3 Solutions
Homework 4 Solutions
Homework 5 Solutions
Homework 6 Solutions
Homework 7 Solutions
Homework 8 Solutions
Homework 9 Solutions
Homework 10 Solutions
Homework 11 Solutions
Homework 12 Solutions
Hints for Selected Miscellaneous Exercises
Solutions to Selected Miscellaneous Exercises
References
Notation and Abbreviations
Index
Preface
Lectures
The Complexity of Computations / 1:
5.

電子ブック

EB
Joseph Migga Kizza, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer London, 2007
所蔵情報: loading…
6.

電子ブック

EB
Toshinori Munakata, David Gries, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer London, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Introduction / 1:
An Overview of the Field of Artificial Intelligence / 1.1:
An Overview of the Areas Covered in this Book / 1.2:
Neural Networks: Fundamentals and the Backpropagation Model / 2:
What is a Neural Network? / 2.1:
A Neuron / 2.2:
Basic Idea of the Backpropagation Model / 2.3:
Details of the Backpropagation Mode / 2.4:
A Cookbook Recipe to Implement the Backpropagation Model / 2.5:
Additional Technical Remarks on the Backpropagation Model / 2.6:
Simple Perceptrons / 2.7:
Applications of the Backpropagation Model / 2.8:
General Remarks on Neural Networks / 2.9:
Neural Networks: Other Models / 3:
Prelude / 3.1:
Associative Memory / 3.2:
Hopfield Networks / 3.3:
The Hopfield-Tank Model for Optimization Problems: The Basics / 3.4:
One-Dimensional Layout / 3.4.1:
Two-Dimensional Layout / 3.4.2:
The Hopfield-Tank Model for Optimization Problems: Applications / 3.5:
The N-Queen Problem / 3.5.1:
A General Guideline to Apply the Hopfield-Tank Model to Optimization Problems / 3.5.2:
Traveling Salesman Problem (TSP) / 3.5.3:
The Kohonen Model / 3.6:
Simulated Annealing / 3.7:
Boltzmann Machines / 3.8:
An Overview / 3.8.1:
Unsupervised Learning by the Boltzmann Machine: The Basics Architecture / 3.8.2:
Unsupervised Learning by the Boltzmann Machine: Algorithms / 3.8.3:
Appendix. Derivation of Delta-Weights / 3.8.4:
Genetic Algorithms and Evolutionary Computing / 4:
What are Genetic Algorithms and Evolutionary Computing? / 4.1:
Fundamentals of Genetic Algorithms / 4.2:
A Simple Illustration of Genetic Algorithms / 4.3:
A Machine Learning Example: Input-to-Output Mapping / 4.4:
A Hard Optimization Example: the Traveling Salesman Problem (TSP) / 4.5:
Schemata / 4.6:
Changes of Schemata Over Generations / 4.6.1:
Example of Schema Processing / 4.6.2:
Genetic Programming / 4.7:
Additional Remarks / 4.8:
Fuzzy Systems / 5:
Fundamentals of Fuzzy Sets / 5.1:
What is a Fuzzy Set? / 5.2.1:
Basic Fuzzy Set Relations / 5.2.2:
Basic Fuzzy Set Operations and Their Properties / 5.2.3:
Operations Unique to Fuzzy Sets / 5.2.4:
Fuzzy Relations / 5.3:
Ordinary (Nonfuzzy) Relations / 5.3.1:
Fuzzy Relations Defined on Ordinary Sets / 5.3.2:
Fuzzy Relations Derived from Fuzzy Sets / 5.3.3:
Fuzzy Logic / 5.4:
Ordinary Set Theory and Ordinary Logic / 5.4.1:
Fuzzy Logic Fundamentals / 5.4.2:
Fuzzy Control / 5.5:
Fuzzy Control Basics / 5.5.1:
Case Study: Controlling Temperature with a Variable Heat Source / 5.5.2:
Extended Fuzzy if-then Rules Tables / 5.5.3:
A Note on Fuzzy Control Expert Systems / 5.5.4:
Hybrid Systems / 5.6:
Fundamental Issues / 5.7:
Rough Sets / 5.8:
Review of Ordinary Sets and Relations / 6.1:
Information Tables and Attributes / 6.3:
Approximation Spaces / 6.4:
Knowledge Representation Systems / 6.5:
More on the Basics of Rough Sets / 6.6:
Case Study and Comparisons with Other Techniques / 6.7:
Rough Sets Applied to the Case Study / 6.8.1:
ID3 Approach and the Case Study / 6.8.2:
Comparisons with Other Techniques / 6.8.3:
Chaos / 7:
What is Chaos? / 7.1:
Representing Dynamical Systems / 7.2:
Discrete dynamical systems / 7.2.1:
Continuous dynamical systems / 7.2.2:
State and Phase Spaces / 7.3:
Trajectory, Orbit and Flow / 7.3.1:
Cobwebs / 7.3.2:
Equilibrium Solutions and Stability / 7.4:
Attractors / 7.5:
Fixed-point attractors / 7.5.1:
Periodic attractors / 7.5.2:
Quasi-periodic attractors / 7.5.3:
Chaotic attractors / 7.5.4:
Bifurcations / 7.6:
Fractals / 7.7:
Applications of Chaos / 7.8:
Index
Preface
Introduction / 1:
An Overview of the Field of Artificial Intelligence / 1.1:
7.

電子ブック

EB
J. M. Selig, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer New York, 2005
所蔵情報: loading…
目次情報: 続きを見る
Preface
Introduction
Lie Groups
Subgroups
Lie Algebra
A Little Kinematics
Line Geometry
Representation Theory
Screw Systems
Clifford Algebra
A Little More Kinematics
The Study Quadric
Statics
Dynamics
Constrained Dynamics
Differential Geometry
References
Index
Preface
Introduction
Lie Groups
8.

電子ブック

EB
Alexander M. Bronstein, Michael M. Bronstein, Ron Kimmel, Fred B. Schneider
出版情報: Springer eBooks Computer Science , Springer New York, 2009
所蔵情報: loading…
目次情報: 続きを見る
Foreword
About the Authors
Preface
Introduction / 1:
Similarity of non-rigid shapes / 1.1:
Correspondence problems / 1.2:
A landscape of problems / 1.3:
Notes
A Taste of Geometry / 2:
Basic terms in metric geometry and topology / 2.1:
Isometries / 2.2:
Length spaces / 2.3:
Manifolds / 2.4:
Embedded surfaces / 2.5:
Curvature and the second fundamental form / 2.6:
Intrinsic view on geometry of surfaces / 2.7:
Bending and rigidity / 2.8:
Intrinsic invariants / 2.9:
Suggested reading
Problems
Discrete Geometry / 3:
Point clouds and sampling / 3.1:
Farthest point sampling / 3.2:
Voronoi tessellation / 3.3:
Centroidal Voronoi sampling and the Lloyd-Max algorithm / 3.4:
Connectivity / 3.5:
Delaunay tessellation / 3.6:
Triangular meshes / 3.7:
Local feature size and curvature-dependent sampling / 3.8:
Approximation quality / 3.9:
Software
Shortest Paths and Fast Marching Methods / 4:
The shortest path problem / 4.1:
Dijkstra's shortest path algorithm / 4.2:
Fast marching methods / 4.3:
Fast marching on parametric surfaces / 4.4:
Marching even faster / 4.5:
Parallel distance computation / 4.6:
Minimal geodesics / 4.7:
Numerical Optimization / 5:
Local versus global optimization / 5.1:
Optimality conditions / 5.2:
Unconstrained optimization algorithms / 5.3:
The quest for a descent direction / 5.4:
Preconditioning / 5.5:
Let Newton be! / 5.6:
Truncated Newton / 5.7:
Quasi-Newton algorithms / 5.8:
Non-convex optimization / 5.9:
Constrained optimization / 5.10:
Penalty and barrier methods / 5.11:
Augmented Lagrangian method / 5.12:
In the Rigid Kingdom / 6:
Moments of joy, moments of sorrow / 6.1:
Iterative closest point algorithms / 6.2:
Enter numerical optimization / 6.3:
Rigid correspondence / 6.4:
Multidimensional Scaling / 7:
Isometric embedding problem / 7.1:
Multidimensional scaling / 7.2:
SMACOF algorithm / 7.3:
Second-order methods / 7.4:
Variations on the stress theme / 7.5:
Multiresolution methods / 7.6:
Multigrid MDS / 7.7:
Vector extrapolation / 7.8:
A trouble with topology / 7.9:
Spectral Embedding / 8:
Classic MDS / 8.1:
Local methods / 8.2:
The Laplace-Beltrami operator / 8.3:
To hear the shape of the drum / 8.4:
Discrete Laplace-Beltrami operator / 8.5:
Non-Euclidean Embedding / 9:
Spherical embedding / 9.1:
Generalized multidimensional scaling / 9.2:
Representation issues / 9.3:
Geodesic distance computation / 9.4:
Minimization of the generalized stress / 9.5:
Multiresolution encore / 9.6:
Isometry-Invariant Similarity / 10:
Equivalence, similarity, and distance / 10.1:
Embedding distance / 10.2:
Gromov-Hausdorff distance / 10.3:
Intrinsic symmetry / 10.4:
Partial Similarity / 11:
Recognition by parts / 11.1:
Paretian approach to partial similarity / 11.2:
Scalar partial similarity / 11.3:
Fuzzy approximation / 11.4:
Extrinsic partial similarity / 11.5:
Intrinsic partial similarity / 11.6:
Not only size matters / 11.7:
Non-rigid Correspondence and Calculus of Shapes / 12:
Intrinsic parameterization / 12.1:
An image processing approach / 12.2:
Minimum distortion correspondence / 12.3:
Texture mapping and transfer / 12.4:
Morphing / 12.5:
Guaranteed self-intersection free morph / 12.6:
Calculus of shapes / 12.7:
Three-dimensional Face Recognition / 13:
Some terminology / 13.1:
A retrospective / 13.2:
Isometric model of facial expressions / 13.3:
Expression-invariant face recognition / 13.4:
Comparison of photometric properties / 13.5:
Epilogue / 14:
Solutions of Selected Problems
Notation
Acronyms
Glossary
References
Subject Index
Author Index
Foreword
About the Authors
Preface
9.

電子ブック

EB
Ming Li, Fred B. Schneider, P. M. B. Vit?nyi, Paul Vit?nyi
出版情報: Springer eBooks Computer Science , New York : Springer New York, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface to the First Edition
Preface to the Second Edition
Preface to the Third Edition
How to Use This Book
Outlines of One-Semester Courses
Contents
List of Figures
Preliminaries / 1:
A Brief Introduction / 1.1:
Prerequisites and Notation / 1.2:
Numbers and Combinatorics / 1.3:
Binary Strings / 1.4:
Asymptotic Notation / 1.5:
Basics of Probability Theory / 1.6:
Basics of Computability Theory / 1.7:
The Roots of Kolmogorov Complexity / 1.8:
Randomness / 1.9:
Prediction and Probability / 1.10:
Information Theory and Coding / 1.11:
State × Symbol Complexity / 1.12:
History and References / 1.13:
Algorithmic Complexity / 2:
The Invariance Theorem / 2.1:
Incompressibility / 2.2:
C as an Integer Function / 2.3:
Random Finite Sequences / 2.4:
*Random Infinite Sequences / 2.5:
Statistical Properties of Finite Sequences / 2.6:
Algorithmic Properties of C / 2.7:
Algorithmic Information Theory / 2.8:
Algorithmic Prefix Complexity / 2.9:
*Sizes of the Constants / 3.1:
K as an Integer Function / 3.3:
Algorithmic Properties of K / 3.5:
*Complexity of Complexity / 3.8:
*Symmetry of Algorithmic Information / 3.9:
Algorithmic Probability / 3.10:
Semicomputable Functions Revisited / 4.1:
Measure Theory / 4.2:
Discrete Sample Space / 4.3:
Universal Average-Case Complexity / 4.4:
Continuous Sample Space / 4.5:
Universal Average-Case Complexity, Continued / 4.6:
Inductive Reasoning / 4.7:
Introduction / 5.1:
Solomonoff's Theory of Prediction / 5.2:
Simple Pac-Learning / 5.3:
Hypothesis Identification by MDL / 5.4:
Nonprobabilistic Statistics / 5.5:
The Incompressibility Method / 5.6:
Three Examples / 6.1:
High-Probability Properties / 6.2:
Combinatorics / 6.3:
Kolmogorov Random Graphs / 6.4:
Compact Routing / 6.5:
Average-Case Analysis of Sorting / 6.6:
Longest Common Subsequence / 6.7:
Formal Language Theory / 6.8:
Online CFL Recognition / 6.9:
Turing Machine Time Complexity / 6.10:
Communication Complexity / 6.11:
Circuit Complexity / 6.12:
Resource-Bounded Complexity / 6.13:
Mathematical Theory / 7.1:
Language Compression / 7.2:
Computational Complexity / 7.3:
Instance Complexity / 7.4:
Kt and Universal Search / 7.5:
Time-Limited Universal Distributions / 7.6:
Logical Depth / 7.7:
Physics, Information, and Computation / 7.8:
Information Theory / 8.1:
Reversible Computation / 8.2:
Information Distance / 8.3:
Normalized Information Distance / 8.4:
Thermodynamics / 8.5:
Entropy Revisited / 8.6:
Quantum Kolmogorov Complexity / 8.7:
Compression in Nature / 8.8:
References / 8.9:
Index
Preface to the First Edition
Preface to the Second Edition
Preface to the Third Edition
10.

電子ブック

EB
Arindama Singh, Fred B. Schneider, Fred B. Schneider. edited by David Gries
出版情報: Springer eBooks Computer Science , Springer London, 2009
所蔵情報: loading…
目次情報: 続きを見る
Mathematical Preliminaries / 1:
Introduction / 1.1:
Sets / 1.2:
Relations and Graphs / 1.3:
Functions and Counting / 1.4:
Proof Techniques / 1.5:
Summary and Problems / 1.6:
Regular Languages / 2:
Language Basics / 2.1:
Regular Expressions / 2.3:
Regular Grammars / 2.4:
Deterministic Finite Automata / 2.5:
Nondeterministic Finite Automata / 2.6:
Summary and Additional Problems / 2.7:
Equivalences / 3:
NFA to DFA / 3.1:
Finite Automata and Regular Grammars / 3.3:
Regular Expression to NFA / 3.4:
NFA to Regular Expression / 3.5:
Structure of Regular Languages / 3.6:
Closure Properties / 4.1:
Nonregular Languages / 4.3:
Myhill-Nerode Theorem / 4.4:
State Minimization / 4.5:
Context-free Languages / 4.6:
Context-free Grammars / 5.1:
Parse Trees / 5.3:
Ambiguity / 5.4:
Eliminating Ugly Productions / 5.5:
Normal Forms / 5.6:
Structure of CFLs / 5.7:
Pushdown Automata / 6.1:
CFG and PDA / 6.3:
Pumping Lemma / 6.4:
Closure Properties of CFLs / 6.5:
Deterministic Pushdown Automata / 6.6:
Computably Enumerable Languages / 6.7:
Unrestricted Grammars / 7.1:
Turing Machines / 7.3:
Acceptance and Rejection / 7.4:
Using Old Machines / 7.5:
Multitape TMs / 7.6:
Nondeterministic TMs and Grammars / 7.7:
A Noncomputably Enumerable Language / 7.8:
Turing Machines as Computers / 8.1:
TMs as Language Deciders / 8.3:
How Many Machines? / 8.4:
Acceptance Problem / 8.5:
Chomsky Hierarchy / 8.6:
Algorithmic Solvability / 8.7:
Problem Reduction / 9.1:
Rice's Theorem / 9.3:
About Finite Automata / 9.4:
About PDA / 9.5:
Post's Correspondence Problem / 9.6:
About Logical Theories / 9.7:
Other Interesting Problems / 9.8:
Computational Complexity / 9.9:
Rate of Growth of Functions / 10.1:
Complexity Classes / 10.3:
Space Complexity / 10.4:
Time Complexity / 10.5:
The Class NP / 10.6:
NP-Completeness / 10.7:
Some NP-Complete Problems / 10.8:
Dealing with NP-Complete Problems / 10.9:
Answers and Hints to Selected Problems / 10.10:
References
Index
Mathematical Preliminaries / 1:
Introduction / 1.1:
Sets / 1.2:
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼