Equivalence of Regular Languages and Languages Accepted by FA

Grammar Generating Odd Binary Numbers

This grammar generates the same language L recognized by the automaton of the Example 2 on NDFA

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 OdNum.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: