T Naughton, NUIM
Back to CS355 home

Lab sheet 2 - Programming finite automata (cont.)

In this lab, you will continue programming finite automata. Again, use Paul Ming's Virtual Turing Machine (VTM) to simulate each finite automaton (FA). Make sure you have read and completed all of last week's lab sheet, including the quiz, before starting on these problems. Once again, you will be formed into teams of two persons. The teams will be randomly chosen this time. This lab will be graded, but the style and level of difficulty of the question will be similar to the difficult questions on last week's sheet, so make sure to complete last week's sheet.

For each of these problems, let L₁ = {ab, aba, abb} and L₂ = {b, aa}.

Machine 2.1 Construct a FA using the VTM that accepts the language L₁ L₂.

Machine 2.2 Construct a FA using the VTM that accepts the language L₂ L₁.

Machine 2.3 Construct a FA using the VTM that accepts the language L₁ L₂.

Machine 2.4 Construct a FA using the VTM that accepts the language L₂*.

Machine 2.5 Construct a FA using the VTM that accepts the language L₁*.