Lecture 31

Learning objectives

After this class, you should be able to:

1. Define a linear bounded automaton (LBA).
2. Given an LBA and a string, show a possible sequence of moves of the LBA on that string.
3. Given a language, construct an LBA for it.

Reading assignment

1. Sections 10.5.
2. Lecture 31 slides on Blackboard.
3. Page 278.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 10.5, exercise #4a.
  2. Section 10.5, exercise #4b.

• Questions on next lecture's material
  1. Are all recursive languages also recursively enumerable? Justify your answer.

---

Last modified: 12 Mar 2014