As for a Finite Automata, we say a finite automata accepts a language if it accepts all strings present in the language as well as REJECTS all strings which are not present in the language.
Is the definition for a regular language the same as that of a finite automata ie, a regular expression should represent all strings of the regular language as well as NOT represent any strings not part of the language ??
Pls clear this.