The language generated by a Type-i grammar is called a Type-i language, i = 0,1,2,3. A Type-i language is also called a context-sensitive language (CSL). We have already observed that a Type-2 language is also called a Context-Free Language (CFL) and a Type-3 language is also called a regular language. Each class of language in the Chomsky hierarchy is characterized as the language generated by a type of automata. These relationships have been summarised in the folowing table for convenience.