A language is considered regular if it can be recognized by a finite state machine. Non-regular languages require memory or the ability to count strings. Examples of non-regular languages include L={anbn} where n can vary, as counting is required. Regular languages can be defined in terms of finite state machines and are closed under operations like union, intersection, concatenation, and Kleene closure.