↓ Skip to main content
What is this page? Embed badge

The Pillars of Computation Theory

Overview of attention for book
Cover of 'The Pillars of Computation Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Introduction
  3. Altmetric Badge
    Chapter 2 Mathematical Preliminaries
  4. Altmetric Badge
    Chapter 3 Online Automata: Exemplars of “State”
  5. Altmetric Badge
    Chapter 4 Finite Automata and Regular Languages
  6. Altmetric Badge
    Chapter 5 Applications of the Myhill–Nerode Theorem
  7. Altmetric Badge
    Chapter 6 Enrichment Topics
  8. Altmetric Badge
    Chapter 7 Countability and Uncountability: The Precursors of “Encoding”
  9. Altmetric Badge
    Chapter 8 Enrichment Topic: “Efficient” Pairing Functions, with Applications
  10. Altmetric Badge
    Chapter 9 Computability Theory
  11. Altmetric Badge
    Chapter 10 Nondeterministic Online Automata
  12. Altmetric Badge
    Chapter 11 Nondeterministic FAs
  13. Altmetric Badge
    Chapter 12 Nondeterminism in Computability Theory
  14. Altmetric Badge
    Chapter 13 Complexity Theory
Attention for Chapter 13: Complexity Theory
Altmetric Badge

Citations

dimensions_citation
12 Dimensions
Summary Dimensions citations
So far, Dimensions has found 12 publications that cite this research output.

12

The most recent citing publications are shown below. View all 12 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.