substrings

Let $$w$$ be any string of length $$n$$ in $${\left\{ {0,1} \right\}^ * }$$. Let $$L$$ be the set of all substrings of $$w.$$ What is the minimum number of states in a non-determin...

How many substrings of different lengths (non-zero) can be formed from a character string of length $$n$$ ?

The number of substrings (of all length inclusive) that can be formed from a character string of length $$n$$ is

The number of sub-strings (of all lengths inclusive) that can be formed from a character string of length $$n$$ is

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.

How many sub strings can be formed from a character string of length $$n$$?

Give the regular expression over $${\left\{ {0,\,\,1} \right\}}$$ to denote the set of proper non-null substrings of the string $$0110$$.