The Pillars of Computation Theory : State, Encoding, Nondeterminism
Computation theory is a discipline that strives to use mathematical tools and concepts in order to expose the nature of the activity that we call computation and to explain a broad range of observed computational phenomena. Why is it harder to perform some computations than others? Are the differenc...
Enregistré dans:
| Hovedforfatter: | |
|---|---|
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
New York, NY :
Springer New York
2010.
Cham : Springer Nature |
| Udgivelse: | First. |
| Serier: | Universitext
|
| Online adgang: | Accès sur la plateforme de l'éditeur https://revue-sommaire.istex.fr/ark:/67375/8Q1-4FP7B7C9-N Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • The pillars of computation theory, state, encoding, nondeterminism, Arnold L. Rosenberg, New York, Springer, 2010, 1 volume (xvii-324 pages), Universitext, 978-0-387-09638-4 • The Pillars of Computation Theory, Texte imprimé, 9780387561172 |
Indholdsfortegnelse:
- PROLEGOMENA Mathematical Preliminaries STATE Online Automata: Exemplars of #x201C;State#x201D; Finite Automata and Regular Languages Applications of the Myhill#x2013;Nerode Theorem Enrichment Topics ENCODING Countability and Uncountability: The Precursors of #x201C;Encoding#x201D; Enrichment Topic: #x201C;Efficient#x201D; Pairing Functions, with Applications Computability Theory NONDETERMINISM Nondeterministic Online Automata Nondeterministic FAs Nondeterminism in Computability Theory Complexity Theory