Advertisement

Basic Notions About Models of Computation

  • José Luis Balcázar
  • Josep Díaz
  • Joaquim Gabarró
Part of the Texts in Theoretical Computer Science An EATCS Series book series (TTCS)

Abstract

The aim of this chapter is to define many concepts that the reader is assumed to know, mainly in order to fix our notation. We present here some concepts of formal languages, set theoretic operations and relations, boolean formulas, and several models of computation, such as finite automata and the different versions of Turing machines: deterministic, nondeterministic, and oracle Turing machines.

Keywords

Turing Machine Finite Automaton Conjunctive Normal Form Boolean Formula Satisfying Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • José Luis Balcázar
    • 1
  • Josep Díaz
    • 1
  • Joaquim Gabarró
    • 1
  1. 1.Department of Software (LSI)Universitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations