chomsky hierarchy in plain english
Maybe you get a better understanding if you remember the automata generating these languages. Regular languages are generated by regular automata. They have only have a finit knowledge of the past (their compute memory has limits) so everytime you have a language with suffixes depending on prefixes (palindrome language) this can not be done with … Read more