Section outline

  • Topics: - Crossing sequences for 2DFAs

               - 2DFAs just accept regular languages

               - Moore automaton

               - Mealey automaton

               - finite-state transducer

               - finite transduction

               - rational relation

               - Theorem of Nivat characterizing rational relations

               - REG is closed under finite transductions

    • Slides for Lecture 5

      (Update: March 21, 2018)

    • The solutions to these problems are to be presented and discussed in the Seminary on March 29, 2018.

    • This file contains solutions to selected problems from Assignment 5.