.
.
.
.
Finite Automata | Regular Languages
Question

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

Answer

n(n+1)/2 +1