This website is a tool for working with type 3 grammars and finite Automata.
You can convert a regular grammar into an equivalent finite Automaton or vice versa.
You can check whether an arbitrary word is contained in the language induced by a type 1 grammar.