close
1.

図書

図書
Ding-Zhu Du, Ker-I Ko
出版情報: New York : John Wiley & Sons, c2001  viii, 396 p. ; 25 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Regular Languages / 1:
Strings and Languages / 1.1:
Regular Languages and Regular Expressions / 1.2:
Graph Representations for Regular Expressions / 1.3:
Finite Automata / 2:
Deterministic Finite Automata / 2.1:
Examples of Deterministic Finite Automata / 2.2:
Nondeterministic Finite Automata / 2.3:
Converting an NFA to a DFA / 2.4:
Finite Automata and Regular Expressions / 2.5:
Closure Properties of Regular Languages / 2.6:
Minimum Deterministic Finite Automata / 2.7:
Pumping Lemmas / 2.8:
Context-Free Languages / 3:
Context-Free Grammars / 3.1:
More Examples of Context-Free Grammars / 3.2:
Parsing and Ambiguity / 3.3:
Pushdown Automata / 3.4:
Pushdown Automata and Context-Free Grammars / 3.5:
Pumping Lemmas for Context-Free Languages / 3.6:
Turing Machines / 4:
One-Tape Turing Machines / 4.1:
Examples of Turing Machines / 4.2:
Multi-Tape Turing Machines / 4.3:
Church-Turing Thesis / 4.4:
Unrestricted Grammars / 4.5:
Primitive Recursive Functions / 4.6:
Pairing Functions and Godel Numberings / 4.7:
Partial Recursive Functions / 4.8:
Computability Theory / 5:
Universal Turing Machines / 5.1:
R. E. Sets and Recursive Sets / 5.2:
Diagonalization / 5.3:
Reducibility / 5.4:
Recursion Theorem / 5.5:
Undecidable Problems / 5.6:
Computational Complexity / 6:
Asymptotic Growth Rate / 6.1:
Time and Space Complexity / 6.2:
Hierarchy Theorems / 6.3:
Nondeterministic Turing Machines / 6.4:
Context-Sensitive Languages / 6.5:
NP-Completeness / 7:
NP / 7.1:
Polynomial-Time Reducibility / 7.2:
Cook's Theorem / 7.3:
More NP-Complete Problems / 7.4:
NP-Complete Optimization Problems / 7.5:
References
Index
Preface
Regular Languages / 1:
Strings and Languages / 1.1:
2.

図書

図書
Aldo de Luca, Stefano Varricchio
出版情報: Berlin ; New York : Springer, 1999  x, 240 p. ; 25 cm
シリーズ名: Monographs in theoretical computer science : an EATCS series
所蔵情報: loading…
目次情報: 続きを見る
Preface
Combinatorics on Words / 1:
Preliminaries / 1.1:
Ininite words / 1.2:
Metric and topology / 1.3:
Periodicity and conjugacy / 1.4:
Lyndon words / 1.5:
Factorial languages and subword complexity / 1.6:
Unavoidable Regularities / 2:
Ramsey's theorem / 2.1:
Van der Waerden's theorem / 2.2:
Uniformly recurrent words / 2.3:
Shirshov's theorem / 2.4:
Bounded languages / 2.5:
Power-free words / 2.6:
Bi-ideal sequences / 2.7:
Canonical factorizations / 2.7.1:
Bi-ideal sequences and recurrence / 2.7.2:
Some extensions of the Shirshov theorem / 2.7.3:
Finiteness Conditions for Semigroups / 3:
Preliminaries on semigroups / 3.1:
Finitely generated semigroups / 3.2:
The Burnside problem / 3.3:
Permutation property / 3.4:
The weak permutability / 3.4.1:
The u;-permutability / 3.4.2:
Partial commutations / 3.5:
Chain conditions / 3.6:
The J-depth decomposition theorem / 3.6.1:
Minimal conditions on principal right ideals / 3.6.2:
Minimal conditions on principal bi-ideals / 3.6.3:
The McNaughton-Zalcstein and Straubing theorems / 3.6.4:
Iteration property / 3.7:
?-iteration property / 3.7.1:
Strong periodicity / 3.7.2:
Permutation and iteration property / 3.8:
Repetitivity / 3.9:
Repetitive morphisms and semigroups / 3.9.1:
Strongly repetitive morphisms / 3.9.2:
Uniformly repetitive semigroups / 3.9.3:
Finitely Recognizable Semigroups / 4:
The Myhill-Nerode theorem / 4.1:
Finitely recognizable semigroups / 4.2:
The factor semigroup / 4.3:
Rewriting systems / 4.4:
The word problem / 4.5:
On a conjecture of Brzozowski / 4.6:
Problems and results / 4.6.1:
On a conjecture of Brown / 4.7:
Regularity Conditions / 5:
Uniform conditions / 5.1:
Pumping properties / 5.2:
Permutative property / 5.3:
Well Quasi-orders and Regularity / 6:
Well quasi-orders / 6.1:
Higman's theorem / 6.2:
The generalized Myhill theorem / 6.3:
Quasi-orders and rewriting systems / 6.4:
A regularity condition for permutable languages / 6.5:
Almost-commutative languages / 6.6:
Copying systems / 6.7:
References
Index
Preface
Combinatorics on Words / 1:
Preliminaries / 1.1:
3.

図書

図書
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
出版情報: Boston : Addison-Wesley, c2001  xiv, 521 p. ; 25 cm
所蔵情報: loading…
目次情報: 続きを見る
Automata: The Methods and the Madness / Chapter 1:
Why Study Automata Theory / 1.1:
Introduction to Formal Proof / 1.2:
Additional Forms of Proof / 1.3:
Inductive Proofs / 1.4:
The Central Concepts of Automata Theory / 1.5:
Summary of Chapter 1 / 1.6:
Gradiance Problems for Chapter 1 / 1.7:
References for Chapter 1 / 1.8:
Finite Automata / Chapter 2:
An Informal Picture of Finite Automata / 2.1:
Deterministic Finite Automata / 2.2:
Nondeterministic Finite Automata / 2.3:
An Application_ Text Search / 2.4:
Finite Automata With EpsilonTransitions / 2.5:
Summary of Chapter 2 / 2.6:
Gradiance Problems for Chapter 2 / 2.7:
References for Chapter 2 / 2.8:
Regular Expressions and Languages / Chapter 3:
Regular Expressions / 3.1:
Finite Automata and Regular Expressions / 3.2:
Applications of Regular Expressions / 3.3:
Algebraic Laws for Regular Expressions / 3.4:
Summary of Chapter 3 / 3.5:
Gradiance Problems for Chapter 3 / 3.6:
References for Chapter 3 / 3.7:
Properties of Regular Languages / Chapter 4:
Proving Languages Not to Be Regular / 4.1:
Closure Properties of Regular Languages / 4.2:
Decision Properties of Regular Languages / 4.3:
Equivalence and Minimization of Automata / 4.4:
Summary of Chapter 4 / 4.5:
Gradiance Problems for Chapter 4 / 4.6:
References for Chapter 4 / 4.7:
Context-Free Grammars and Languages / Chapter 5:
Context-Free Grammars / 5.1:
Parse Trees / 5.2:
Applications of Context-Free Grammars / 5.3:
Ambiguity in Grammars and Languages / 5.4:
Summary of Chapter 5 / 5.5:
Gradiance Problems for Chapter 5 / 5.6:
References for Chapter 5 / 5.7:
Pushdown Automata / Chapter 6:
Definition of the Pushdown Automaton / 6.1:
The Languages of a PDA / 6.2:
Equivalence of PDA's and CFG's / 6.3:
Deterministic Pushdown Automata / 6.4:
Summary of Chapter 6 / 6.5:
Gradiance Problems for Chapter 6 / 6.6:
References for Chapter 6 / 6.7:
Properties of Context-Free Languages / Chapter 7:
Normal Forms for Context-Free Grammars / 7.1:
The Pumping Lemma for Context-Free Languages / 7.2:
Closure Properties of Context-Free Languages / 7.3:
Decision Properties of CFL's / 7.4:
Summary of Chapter 7 / 7.5:
Gradiance Problems for Chapter 7 / 7.6:
References for Chapter 7 / 7.7:
Introduction to Turing Machines / Chapter 8:
Problems That Computers Cannot Solve / 8.1:
The Turing Machine / 8.2:
Programming Techniques for Turing Machines / 8.3:
Extensions to the Basic Turing Machine / 8.4:
Restricted Turing Machines / 8.5:
Turing Machines and Computers / 8.6:
Summary of Chapter 8 / 8.7:
Gradiance Problems for Chapter 8 / 8.8:
References for Chapter 8 / 8.9:
Undecidability / Chapter 9:
A Language That Is Not Recursively Enumerable / 9.1:
An Undecidable Problem That Is RE / 9.2:
Undecidable Problems About Turing Machines / 9.3:
Post's Correspondence Problem / 9.4:
Other Undecidable Problems / 9.5:
Summary of Chapter 9 / 9.6:
Gradiance Problems for Chapter 9 / 9.7:
References for Chapter 9 / 9.8:
Intractable Problems / Chapter 10:
The Classes P and NP / 10.1:
An NP-Complete Problem / 10.2:
A Restricted Satisfiability Problem / 10.3:
Additional NP-Complete Problems / 10.4:
Summary of Chapter 10 / 10.5:
Gradiance Problems for Chapter 10 / 10.6:
References for Chapter 10 / 10.7:
Additional Classes of Problems / Chapter 11:
Complements of Languages in NP / 11.1:
Problems Solvable in Polynomial Space / 11.2:
A Problem That Is Complete for PS / 11.3:
Language Classes Based on Randomization / 11.4:
The Complexity of Primality Testing / 11.5:
Summary of Chapter 11 / 11.6:
Gradiance Problems for Chapter 11 / 11.7:
References for Chapter 11 / 11.8:
Index
Automata: The Methods and the Madness / Chapter 1:
Why Study Automata Theory / 1.1:
Introduction to Formal Proof / 1.2:
4.

図書

図書
Grzegorz Rozenberg, Arto Salomaa
出版情報: New York : Academic Press, 1980  xvi, 352 p. ; 24 cm
シリーズ名: Pure and applied mathematics ; 90
所蔵情報: loading…
5.

図書

図書
Derick Wood
出版情報: Berlin ; New York : Springer-Verlag, 1980  ix, 314 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 91
所蔵情報: loading…
6.

図書

図書
Anton Nijholt
出版情報: Berlin ; New York : Springer-Verlag, 1980  vii, 253 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 93
所蔵情報: loading…
7.

図書

図書
Robin Milner
出版情報: Berlin ; New York : Springer-Verlag, 1980  vi, 171 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 92
所蔵情報: loading…
8.

図書

図書
J. Craig Cleaveland, Robert C. Uzgalis
出版情報: New York : Elsevier, c1977  xiii, 154 p. ; 24 cm
シリーズ名: Elsevier computer science library ; . Programming languages series ; 4
所蔵情報: loading…
9.

図書

図書
edited by Alfred V. Aho ; contributing authors, Ronald V. Book ... [et al.]
出版情報: Englewood Cliffs, N.J. : Prentice-Hall, c1973  x, 245 p. ; 24 cm
シリーズ名: Prentice-Hall series in automatic computation
所蔵情報: loading…
10.

図書

図書
Gheorghe Păun, Arto Salomaa (eds.)
出版情報: Berlin ; New York : Springer, c1997  ix, 464 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1218
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼