Introduction to Formal Languages by György E. Révész

Author:György E. Révész
Language: eng
Format: epub, pdf
Publisher: Dover Publications, Inc
Published: 2013-12-08T16:00:00+00:00

PROOF On the basis of the Church-Turing thesis to every recursively enumerable language L there is a Turing machine that enumerates L. Without loss of generality it can be assumed that the enumerating process starts with the initial configuration q0B and produces the sequence of configurations

W1qfP1,W2qfP2,…,WnqfPn,…

as the listing of the words Pi ∈ L. The state qf is a distinguished state whose appearance relates the fact that the machine has just finished with the construction of a new word. The words Wi represent the work area of the tape and they store the intermediary information for the enumerating procedure. For the above configurations we have

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.