Equivalence of Regular Languages and Languages Accepted by FA

Grammar Generating strings with fixed number of b's

This grammar generates on the alphabet {a,b} the set of words: 
 {w: w has 3k+1 b's for some k in N}

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

To visualize the construction of the equivalent automaton and the word derivation:

  1. click on the gram button of the working session menu
  2. load the grammar file example09.gr from 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: