Given that language $${L_1}$$ is regular and that the language $${L_1} \cap {L_2}$$ is regular is the language $${L_2}$$ is always regular?

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

The regular expression for the language recognized by the finite state automation of is _________.

State True or False with one line explanation:

A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).