I am new to automata theory. I am well aware of the definition of regular language in automata, that is "a language is called a regular language if some finite automaton recognizes/accepts it" [MS]. However, I'm confused why such language (set of strings) is called regular.

  1. what is regular about regular language?

  2. Is there any relation between regular set in automata theory and regular set in mathematics?