| 000 | 00279nam a2200109Ia 4500 | ||
|---|---|---|---|
| 999 |
_c170367 _d170367 |
||
| 020 | _a9780387096384 | ||
| 040 | _cCUS | ||
| 082 |
_a511.352 _bROS/P |
||
| 100 | _aRosenberg, Aarnold L. | ||
| 245 | 4 |
_aThe pillars of computation theory: state, encoding, nondeterminism/ _cArnold L. Rosenberg |
|
| 260 |
_aNew York: _bSpringer, _c2010. |
||
| 300 |
_axvii, 324 p. : _bill. ; _c24 cm. |
||
| 505 | _aPt. 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. | ||
| 650 | _aComputational complexity | ||
| 650 | _aLogic, Symbolic and mathematical | ||
| 650 | _aAlgorithms | ||
| 650 | _aMathematics | ||
| 942 | _cWB16 | ||