Devices for Computation

Abstract

To study computational processes, we have to fix a computational device first. In this chapter, we study Turing machines and circuits as models of computation. We use the standard notations of formal language theory and represent these notations briefly now. An alphabet is any set A. The elements of an alphabet A are called letters. The concatenation of sets A and B is a set AB consisting of strings formed of any element of A followed by any element of B. Especially, A ^k is the set of strings of length k over A. These strings are also called words. The concatenation w ₁ w ₂ of words w ₁ and w ₂ is just the word w ₁ followed by w ₂. The length of word w is denoted by |w| or ℓ(w) and defined as the number of the letters that constitute w. We also define A ⁰ as the set that contains only the empty word ∈ that has no letters, and A* = A ⁰ ∪ A ^l ∪ A ² ∪... is the set of all words over A. Mathematically speaking, A* is the free monoid generated by the elements of A, having the concatenation as the monoid operation and ∈ as the unit element.