A tutorial on finite automata

Equivalence of regular languages and languages accepted by FA

Languages generated by regular grammars, are recognized by finite automata and conversely, any language recognized by a FA can be generated by a regular grammar.

Examples

  1. Esempio 1: Grammar Generating a(bb)*bc
  2. Esempio 2: Grammar Generating Odd Binary Number
  3. Esempio 3: Grammar Generating strings with a fixed number of b's
Back to Index