Alan JoTemplate Gallery
Language
Grammars defines Language
← Chomsky Hierarchy
a^i : regular
a^i b^i : context-free
a^i b^i c^i
Language is shared part so L(G) = L(R) = L(F) = L(P) = L(T) possible
automaton and Grammar can be various but Language is unique two are for express Language Regular language only has equivalence algorithm