Since tape machines or one tape Turing machines are not very appropriate for practical programming of word functions, in this chapter we introduce a generalization of the register machines from numbers to words, the stack machines. Stack machines, especially the generalized stack machines, are a very useful and natural tool for formulating algorithms which operate on words. We shall prove that the stack machine computable word functions are exactly the (tape) computable word functions.
Unable to display preview. Download preview PDF.