Normal view MARC view ISBD view

The pillars of computation theory: state, encoding, nondeterminism/ Arnold L. Rosenberg

By: Rosenberg, Aarnold LMaterial type: Text

TextPublication details: New York: Springer, 2010Description: xvii, 324 p. : ill. ; 24 cmISBN: 9780387096384Subject(s): Computational complexity | Logic, Symbolic and mathematical | Algorithms | MathematicsDDC classification: 511.352

Contents:

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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 1 )
Comments ( 0 )

Holdings
Item 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

Total holds: 0

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.

to post a comment.