The pillars of computation theory: state, encoding, nondeterminism/ Arnold L. Rosenberg
Material type: TextPublication details: New York: Springer, 2010Description: xvii, 324 p. : ill. ; 24 cmISBN: 9780387096384Subject(s): Computational complexity | Logic, Symbolic and mathematical | Algorithms | MathematicsDDC classification: 511.352Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
General Books | Central Library, Sikkim University General Book Section | 511.352 ROS/P (Browse shelf(Opens below)) | Available | P25345 |
Browsing Central Library, Sikkim University shelves, Shelving location: General Book Section Close shelf browser (Hides shelf browser)
511.35 SIP/I Introduction to the Theory of Computation, | 511.352 GAR/I Introduction to Elementary Computational Modeling/ | 511.352 NIE/Q Quantum computation and quantum information/ | 511.352 ROS/P The pillars of computation theory: state, encoding, nondeterminism/ | 511.352 TOU/T Theory of computation/ | 511.352 ZIM/C Computational Complexity/ | 511.42 BAY/E Essentials of mathematical methods in science and engineering/ |
Pt. I. Prolegomena. Introduction --
Mathematical preliminaries --
pt. II. State. Online automata: exemplars of "state" --
Finite automata and regular languages --
Applications of the Myhill-Nerode theorem --
Enrichment topics --
pt. III. Encoding. Countability and uncountability: the precursors of "encoding" --
Enrichment topic: "efficient" pairing functions, with applications --
Computability theory --
pt. IV. Nondeterminism. Nondeterministic online automata --
Nondeterministic FAs --
Nondeterminism in computability theory --
Complexity theory.
There are no comments on this title.