29.11.2001: (Gruppenarbeit & Berichte: Interpreter für endliche Automaten)

Tasks:

• Consider the following language: {b, ab, aab, aaab, ... }
  • Write a regular expression which defines this language.
  • Write a regular grammar which generates this language.
  • Design a finite automaton which accepts this language.
  • Work out a set of rules which will
    • translate the regular expression into the automaton
    • translate the automaton into the regular expression
• Test the regular grammar on an internet demo, treating the characters as separate lexical items: {a, b}