Borrow it
Coverart for item
The Resource Computation engineering : applied automata theory and logic, Ganesh Gopalakrishnan

Computation engineering : applied automata theory and logic, Ganesh Gopalakrishnan

Creator
Summary
"This classroom-tested undergraduate textbook is unique in presenting logic and automata theory as a single subject ... I highly recommend this book to you as the best route I know into the concepts underlying modern industrial formal verification."--Dr. Michael J.C. Gordon FRS, The University of Cambridge Computer Laboratory "This is a valuable book in my opinion. I learned a good deal from reading it, and encountered many attractive topic treatments and fresh insights, throughout. I certainly plan to add it to my reference shelf and recommend it to my students and colleagues. It covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented. The book is well organized for coordinated use in several courses, ranging from core udnergraduate to senior and graduate level topics."--Professor Steven D. Johnson, Indiana University
Language
eng
Work
Publication
Extent
1 online resource (xxxv, 471 pages)
Contents
  • Mathematical Preliminaries
  • Cardinalities and Diagonalization
  • Binary Relations
  • Mathematical Logic, Induction, Proofs
  • Dealing with Recursion
  • Strings and Languages
  • Machines, Languages, DFA
  • NFA and Regular Expressions
  • Operations on Regular Machinery
  • The Automaton/Logic Connection, Symbolic Techniques
  • The 'Pumping' Lemma
  • Context-free Languages
  • Push-down Automata and Context-free Grammars
  • Turing Machines
  • Basic Undecidability Proofs
  • Advanced Undecidability Proofs
  • Basic Notions in Logic including SAT
  • Complexity Theory and NP-Completeness
  • DFA for Presburger Arithmetic
  • Model Checking: Basics
  • Model Checking: Temporal Logics
  • Model Checking: Algorithms
  • Conclusions
Isbn
9780387325200
Instance
Label
Computation engineering : applied automata theory and logic
Title
Computation engineering
Title remainder
applied automata theory and logic
Statement of responsibility
Ganesh Gopalakrishnan
Creator
Subject
Language
eng
Summary
"This classroom-tested undergraduate textbook is unique in presenting logic and automata theory as a single subject ... I highly recommend this book to you as the best route I know into the concepts underlying modern industrial formal verification."--Dr. Michael J.C. Gordon FRS, The University of Cambridge Computer Laboratory "This is a valuable book in my opinion. I learned a good deal from reading it, and encountered many attractive topic treatments and fresh insights, throughout. I certainly plan to add it to my reference shelf and recommend it to my students and colleagues. It covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented. The book is well organized for coordinated use in several courses, ranging from core udnergraduate to senior and graduate level topics."--Professor Steven D. Johnson, Indiana University
Is part of
Cataloging source
GW5XE
http://library.link/vocab/creatorName
Gopalakrishnan, Ganesh
Dewey number
004.01/51
Illustrations
illustrations
Index
index present
Language note
English
LC call number
QA76.9.M35
LC item number
G67 2006eb
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/subjectName
  • Computer science
  • Computer logic
  • Machine theory
  • Computer logic
  • Machine theory
  • Informatique
  • Logique informatique
  • Automates mathématiques, Théorie des
  • Computer science
  • Informatique
  • Computer logic
  • Computer science
  • Machine theory
Label
Computation engineering : applied automata theory and logic, Ganesh Gopalakrishnan
Instantiates
Publication
Bibliography note
Includes bibliographical references (pages 453-460) and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Mathematical Preliminaries -- Cardinalities and Diagonalization -- Binary Relations -- Mathematical Logic, Induction, Proofs -- Dealing with Recursion -- Strings and Languages -- Machines, Languages, DFA -- NFA and Regular Expressions -- Operations on Regular Machinery -- The Automaton/Logic Connection, Symbolic Techniques -- The 'Pumping' Lemma -- Context-free Languages -- Push-down Automata and Context-free Grammars -- Turing Machines -- Basic Undecidability Proofs -- Advanced Undecidability Proofs -- Basic Notions in Logic including SAT -- Complexity Theory and NP-Completeness -- DFA for Presburger Arithmetic -- Model Checking: Basics -- Model Checking: Temporal Logics -- Model Checking: Algorithms -- Conclusions
Control code
209906974
Dimensions
unknown
Extent
1 online resource (xxxv, 471 pages)
Form of item
online
Isbn
9780387325200
Lccn
2006920602
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/0-387-32520-4
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
978-0-387-24418-1
Specific material designation
remote
System control number
(OCoLC)209906974
Label
Computation engineering : applied automata theory and logic, Ganesh Gopalakrishnan
Publication
Bibliography note
Includes bibliographical references (pages 453-460) and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Mathematical Preliminaries -- Cardinalities and Diagonalization -- Binary Relations -- Mathematical Logic, Induction, Proofs -- Dealing with Recursion -- Strings and Languages -- Machines, Languages, DFA -- NFA and Regular Expressions -- Operations on Regular Machinery -- The Automaton/Logic Connection, Symbolic Techniques -- The 'Pumping' Lemma -- Context-free Languages -- Push-down Automata and Context-free Grammars -- Turing Machines -- Basic Undecidability Proofs -- Advanced Undecidability Proofs -- Basic Notions in Logic including SAT -- Complexity Theory and NP-Completeness -- DFA for Presburger Arithmetic -- Model Checking: Basics -- Model Checking: Temporal Logics -- Model Checking: Algorithms -- Conclusions
Control code
209906974
Dimensions
unknown
Extent
1 online resource (xxxv, 471 pages)
Form of item
online
Isbn
9780387325200
Lccn
2006920602
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/0-387-32520-4
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
978-0-387-24418-1
Specific material designation
remote
System control number
(OCoLC)209906974

Subject

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...