If you are given a language, how do you find out if it is regular, CF, but not regular, or phrase, but not CF? Is there a good way to attack this problem? I might accidentally try to do an FA or PDA, but I feel that there is a better way to do this.
Classic example:
L = {a ^ nb ^ nc ^ n | n> = 0}
Where can I start? Thank.
source
share