Sipser 3.1

Read Sipser § 3.1

  1. Relate the ideas of accept, reject, or loop to your experience with programming.
  2. For the Turing Machine presented in example 3.9, give the sequence of configurations that the machine enters when started on input string 11.
  3. For the Turing Machine presented in example 3.9, give the sequence of configurations that the machine enters when started on input string 1#1
  4. Give an implementation-level diagram of a Turing
    machine that decides the language $$L = \{0^n1^n | n ≥ 0\}$$.
css.php
The views and opinions expressed on individual web pages are strictly those of their authors and are not official statements of Grinnell College. Copyright Statement.