How many substrings (of all lengths inclusive ) can be formed from a character string of length $$n$$? Assume all characters to be distinct. Prove your answer.

Is the class of regular sets closed under infinite union? Explain.

Context free languages and regular languages are both closed under the operation(s) of :

Which of the following problems are un-decidable?