2006

Computation Engineering

Applied Automata Theory and Logic

Authors:

ISBN: 978-0-387-24418-1 (Print) 978-0-387-32520-0 (Online)

Table of contents (24 chapters)

previous Page of 2
  1. No Access

    Book Chapter

    Pages 1-14

    Introduction

  2. No Access

    Book Chapter

    Pages 15-36

    Mathematical Preliminaries

  3. No Access

    Book Chapter

    Pages 37-51

    Cardinalities and Diagonalization

  4. No Access

    Book Chapter

    Pages 53-71

    Binary Relations

  5. No Access

    Book Chapter

    Pages 73-92

    Mathematical Logic, Induction, Proofs

  6. No Access

    Book Chapter

    Pages 93-104

    Dealing with Recursion

  7. No Access

    Book Chapter

    Pages 105-117

    Strings and Languages

  8. No Access

    Book Chapter

    Pages 119-132

    Machines, Languages, DFA

  9. No Access

    Book Chapter

    Pages 133-158

    NFA and Regular Expressions

  10. No Access

    Book Chapter

    Pages 159-184

    Operations on Regular Machinery

  11. No Access

    Book Chapter

    Pages 185-203

    The Automaton/Logic Connection, Symbolic Techniques

  12. No Access

    Book Chapter

    Pages 205-215

    The ‘Pumping’ Lemma

  13. No Access

    Book Chapter

    Pages 217-244

    Context-free Languages

  14. No Access

    Book Chapter

    Pages 245-270

    Push-down Automata and Context-free Grammars

  15. No Access

    Book Chapter

    Pages 271-290

    Turing Machines

  16. No Access

    Book Chapter

    Pages 291-308

    Basic Undecidability Proofs

  17. No Access

    Book Chapter

    Pages 309-321

    Advanced Undecidability Proofs

  18. No Access

    Book Chapter

    Pages 323-344

    Basic Notions in Logic including SAT

  19. No Access

    Book Chapter

    Pages 345-367

    Complexity Theory and NP-Completeness

  20. No Access

    Book Chapter

    Pages 369-380

    DFA for Presburger Arithmetic

previous Page of 2