Equivalence of Regular Languages and Languages Accepted by FA

Grammar Generating a(bb)*bc

This grammar generates the language a(bb)*bc, i. e. the set of words that begin with an a followed by an odd number of b and a final c. This language L is the same one recognized by the automaton of Example 2 in DFA section.

For local users: to run AUTOMATA (read here before running).

To visualize the construction of the equivalent automaton:

  1. click on the gram button of the working session menu
  2. load the grammar file example02.gr in the directory GrammEx
  3. choose between step by step and fast process to generate the automaton
In the Grammar Box, you can generate a word according to the given grammar and see that it is accepted by the equivalent automaton: