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.

図書

図書
Wilfried Brauer ... [et al.] (eds.)
出版情報: Berlin : Springer, c2002  xxxvi, 429 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2300
所蔵情報: loading…
目次情報: 続きを見る
Bibliography of Grzegorz Rozenberg
Words, Languages, Automata / I:
Balanced Grammars and Their Languages / Jean Berstel ; Luc Boasson
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids / Volker Diekert ; Paul Gastin
The Delta Operation: From Strings to Trees to Strings / Joost Engelfriet
Infinite Solutions of Marked Post Correspondence Problem / Vesa Halava ; Tero Harju
The Branching Point Approach to ConwayÆs Problem / Juhani Karhumaki ; Ion Petre
A Survey of Some Quantitative Approaches to the Notion of Information / Aldo de Luca
Nondeterministic Trajectories / Alexandru Mateescu ; Arto Salomaa
Binary Patterns in Infinite Binary Words / Antonio Restivo ; Sergio Salemi
Graph Transformations / II:
A Sight-seeing Tour of the Computational Landscape of Graph Transformation / Hans-Jörg Kreowski
Local Action Systems and DPO Graph Transformation / DirkJanssens
Bisimulation Equivalences for Graph Grammars / Paolo Baldan ; Andrea Corradini ; Ugo Montanari
Petri Nets / III:
High-Level Net Processes / Hartmut Ehrig ; Kathrin Hoffmann ; Julia Padberg ; Reiko Heckel
Petri Net Control for Grammar Systems / Maurice ter Beek ; Jetty Kleijn
Regular Event Structures and Finite Petri Nets: A Conjecture / P.S. Thiagarajan
Concurrent Computing / IV:
Towards Team-Automata-Driven Object-Oriented Collaborative Work / Gregor Engels ; LuukGroenewegen
Grammars as Processes / Javier Esparza
Temporal Concurrent Constraint Programming: Applications and Behavior / Mogens Nielsen ; FrankD. Valencia
Molecular Computing / V:
Rewriting P Systems with Conditional Communication / Paolo Bottoni ; Anna Labella ; Carlos Martín-Vide ; Gheorghe Paun
An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation / Tom Head
Upper Bounds for Restricted Splicing / HendrikJan Hoogeboom ; Nikè van Vugt
Codes, Involutions, and DNA Encodings / Lila Kari ; Rob Kitto ; Gabriel Thierrin
DNA Manipulations in Ciliates / David M. Prescott
A Magic Pot Self-assembly Computation Revisited / Takashi Yokomori ; Yasubumi Sakakibara ; Satoshi Kobayashi
Author Index
Bibliography of Grzegorz Rozenberg
Words, Languages, Automata / I:
Balanced Grammars and Their Languages / Jean Berstel ; Luc Boasson
3.

図書

図書
Aart Middeldorp ... [et al.] (eds.)
出版情報: Berlin : Springer, c2005  xviii, 638 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3838
所蔵情報: loading…
4.

図書

図書
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:
5.

図書

図書
[редколлегия, Г.Ф. Фрицнович (ответственный редактор) ... и др.]
出版情報: Рига : "Зинатне", 1967  225 p. ; 22 cm
所蔵情報: loading…
6.

図書

図書
М.Л. Цетлин
出版情報: Москва : Изд-во "Наука", главная редакция физико-математической литературы, 1969  316 p. ; 21 cm
所蔵情報: loading…
7.

図書

図書
Erich Grädel, Wolfgang Thomas, Thomas Wilke (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  viii, 385 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2500
所蔵情報: loading…
8.

図書

図書
Roy Harris
出版情報: Ithaca, N.Y. : Cornell University Press, 1987  182 p. ; 23 cm
所蔵情報: loading…
9.

図書

図書
by Václav Pinkava
出版情報: Cambridge, Mass. : Abacus Press, 1988  132 p. ; 25 cm
所蔵情報: loading…
10.

図書

図書
Robin Milner
出版情報: Berlin ; New York : Springer-Verlag, 1980  vi, 171 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 92
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼