Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata and computability / Dexter C. Kozen
| Automata and computability / Dexter C. Kozen |
| Autore | Kozen, Dexter <1951- > |
| Pubbl/distr/stampa | New York : Springer-Verlag, c1997 |
| Descrizione fisica | xiii, 400 p. ; 24 cm |
| Disciplina | 511.3 |
| Collana | Undergraduate texts in computer science |
| Soggetto non controllato | Teoria degli automi - Logica matematica |
| ISBN | 0-387-94907-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990001446490403321 |
Kozen, Dexter <1951- >
|
||
| New York : Springer-Verlag, c1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata and computability / Dexter C. Kozen
| Automata and computability / Dexter C. Kozen |
| Autore | Kozen, Dexter C. |
| Pubbl/distr/stampa | New York [etc.] : Springer, copyr. 1997 |
| Descrizione fisica | XIII, 400 p. : ill. ; 20 cm |
| Disciplina | 511.3 |
| Collana | Undergraduate texts in computer science |
| Soggetto non controllato |
Teoria delle macchine
Funzioni computabili |
| ISBN | 0-387-94907-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990001078270203316 |
|
Kozen, Dexter C.
|
||
| New York [etc.] : Springer, copyr. 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata and Computability [[electronic resource] /] / by Dexter C. Kozen
| Automata and Computability [[electronic resource] /] / by Dexter C. Kozen |
| Autore | Kozen Dexter C |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIII, 400 p.) |
| Disciplina | 511.3 |
| Collana | Undergraduate Texts in Computer Science |
| Soggetto topico |
Computers
Algorithms Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN |
1-4612-7309-9
1-4612-1844-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lectures -- 1 Course Roadmap and Historical Perspective -- 2 Strings and Sets -- 3 Finite Automata and Regular Sets -- 4 More on Regular Sets -- 5 Nondeterministic Finite Automata -- 6 The Subset Construction -- 7 Pattern Matching -- 8 Pattern Matching and Regular Expressions -- 9 Regular Expressions and Finite Automata -- A Kleene Algebra and Regular Expressions -- 10 Homomorphisms -- 11 Limitations of Finite Automata -- 12 Using the Pumping Lemma -- 13 DFA State Minimization -- 14 A Minimization Algorithm -- 15 Myhill—Nerode Relations -- 16 The Myhill—Nerode Theorem -- B Collapsing Nondeterministic Automata -- C Automata on Terms -- D The Myhill—Nerode Theorem for Term Automata -- 17 Two-Way Finite Automata -- 18 2DFAs and Regular Sets -- 19 Context-Free Grammars and Languages -- 20 Balanced Parentheses -- 21 Normal Forms -- 22 The Pumping Lemma for CFLs -- 23 Pushdown Automata -- E Final State Versus Empty Stack -- 24 PDAs and CFGs -- 25 Simulating NPDAs by CFGs -- F Deterministic Pushdown Automata -- 26 Parsing -- 27 The Cocke—Kasami—Younger Algorithm -- G The Chomsky—Schützenberger Theorem -- H Parikh’s Theorem -- 28 Turing Machines and Effective Computability -- 29 More on Turing Machines -- 30 Equivalent Models -- 31 Universal Machines and Diagonalization -- 32 Decidable and Undecidable Problems -- 33 Reduction -- 34 Rice’s Theorem -- 35 Undecidable Problems About CFLs -- 36 Other Formalisms -- 37 The a-Calculus -- I While Programs -- J Beyond Undecidability -- 38 Gödel’s Incompleteness Theorem -- 39 Proof of the Incompleteness Theorem -- K Gödel’s Proof -- Exercises -- Homework Sets -- 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 -- Finite Automata and Regular Sets -- Pushdown Automata and Context-Free Languages -- Turing Machines and Effective Computability -- Hints and Solutions -- Hints for Selected Miscellaneous Exercises -- Solutions to Selected Miscellaneous Exercises -- References -- Notation and Abbreviations. |
| Record Nr. | UNINA-9910480043703321 |
|
Kozen Dexter C
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata and Computability [[electronic resource] /] / by Dexter C. Kozen
| Automata and Computability [[electronic resource] /] / by Dexter C. Kozen |
| Autore | Kozen Dexter C |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIII, 400 p.) |
| Disciplina | 511.3 |
| Collana | Undergraduate Texts in Computer Science |
| Soggetto topico |
Computers
Algorithms Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN |
1-4612-7309-9
1-4612-1844-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lectures -- 1 Course Roadmap and Historical Perspective -- 2 Strings and Sets -- 3 Finite Automata and Regular Sets -- 4 More on Regular Sets -- 5 Nondeterministic Finite Automata -- 6 The Subset Construction -- 7 Pattern Matching -- 8 Pattern Matching and Regular Expressions -- 9 Regular Expressions and Finite Automata -- A Kleene Algebra and Regular Expressions -- 10 Homomorphisms -- 11 Limitations of Finite Automata -- 12 Using the Pumping Lemma -- 13 DFA State Minimization -- 14 A Minimization Algorithm -- 15 Myhill—Nerode Relations -- 16 The Myhill—Nerode Theorem -- B Collapsing Nondeterministic Automata -- C Automata on Terms -- D The Myhill—Nerode Theorem for Term Automata -- 17 Two-Way Finite Automata -- 18 2DFAs and Regular Sets -- 19 Context-Free Grammars and Languages -- 20 Balanced Parentheses -- 21 Normal Forms -- 22 The Pumping Lemma for CFLs -- 23 Pushdown Automata -- E Final State Versus Empty Stack -- 24 PDAs and CFGs -- 25 Simulating NPDAs by CFGs -- F Deterministic Pushdown Automata -- 26 Parsing -- 27 The Cocke—Kasami—Younger Algorithm -- G The Chomsky—Schützenberger Theorem -- H Parikh’s Theorem -- 28 Turing Machines and Effective Computability -- 29 More on Turing Machines -- 30 Equivalent Models -- 31 Universal Machines and Diagonalization -- 32 Decidable and Undecidable Problems -- 33 Reduction -- 34 Rice’s Theorem -- 35 Undecidable Problems About CFLs -- 36 Other Formalisms -- 37 The a-Calculus -- I While Programs -- J Beyond Undecidability -- 38 Gödel’s Incompleteness Theorem -- 39 Proof of the Incompleteness Theorem -- K Gödel’s Proof -- Exercises -- Homework Sets -- 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 -- Finite Automata and Regular Sets -- Pushdown Automata and Context-Free Languages -- Turing Machines and Effective Computability -- Hints and Solutions -- Hints for Selected Miscellaneous Exercises -- Solutions to Selected Miscellaneous Exercises -- References -- Notation and Abbreviations. |
| Record Nr. | UNINA-9910789223903321 |
|
Kozen Dexter C
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata and Computability / / by Dexter C. Kozen
| Automata and Computability / / by Dexter C. Kozen |
| Autore | Kozen Dexter C |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIII, 400 p.) |
| Disciplina | 511.3 |
| Collana | Undergraduate Texts in Computer Science |
| Soggetto topico |
Computers
Algorithms Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN |
1-4612-7309-9
1-4612-1844-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lectures -- 1 Course Roadmap and Historical Perspective -- 2 Strings and Sets -- 3 Finite Automata and Regular Sets -- 4 More on Regular Sets -- 5 Nondeterministic Finite Automata -- 6 The Subset Construction -- 7 Pattern Matching -- 8 Pattern Matching and Regular Expressions -- 9 Regular Expressions and Finite Automata -- A Kleene Algebra and Regular Expressions -- 10 Homomorphisms -- 11 Limitations of Finite Automata -- 12 Using the Pumping Lemma -- 13 DFA State Minimization -- 14 A Minimization Algorithm -- 15 Myhill—Nerode Relations -- 16 The Myhill—Nerode Theorem -- B Collapsing Nondeterministic Automata -- C Automata on Terms -- D The Myhill—Nerode Theorem for Term Automata -- 17 Two-Way Finite Automata -- 18 2DFAs and Regular Sets -- 19 Context-Free Grammars and Languages -- 20 Balanced Parentheses -- 21 Normal Forms -- 22 The Pumping Lemma for CFLs -- 23 Pushdown Automata -- E Final State Versus Empty Stack -- 24 PDAs and CFGs -- 25 Simulating NPDAs by CFGs -- F Deterministic Pushdown Automata -- 26 Parsing -- 27 The Cocke—Kasami—Younger Algorithm -- G The Chomsky—Schützenberger Theorem -- H Parikh’s Theorem -- 28 Turing Machines and Effective Computability -- 29 More on Turing Machines -- 30 Equivalent Models -- 31 Universal Machines and Diagonalization -- 32 Decidable and Undecidable Problems -- 33 Reduction -- 34 Rice’s Theorem -- 35 Undecidable Problems About CFLs -- 36 Other Formalisms -- 37 The a-Calculus -- I While Programs -- J Beyond Undecidability -- 38 Gödel’s Incompleteness Theorem -- 39 Proof of the Incompleteness Theorem -- K Gödel’s Proof -- Exercises -- Homework Sets -- 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 -- Finite Automata and Regular Sets -- Pushdown Automata and Context-Free Languages -- Turing Machines and Effective Computability -- Hints and Solutions -- Hints for Selected Miscellaneous Exercises -- Solutions to Selected Miscellaneous Exercises -- References -- Notation and Abbreviations. |
| Record Nr. | UNINA-9910812422503321 |
|
Kozen Dexter C
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||