Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

We say a language $L$ is regular if it is accepted by some finite automaton $M$. I would like someone to clarify this definition. Given a finite automaton $(Q, \Sigma, \delta, q_0, F)$, we define the language of the automaton to be

$$L(M) = \{w \in \Sigma^* : \delta(q_0, w) \in F \}$$

If a language $L$ is merely contained in $L(M)$, $(L \subseteq L(M))$, do we say that $M$ accepts $L$, and thereby, $L$ is regular?

share|cite|improve this question
By the way, the word is 'automaton', not 'automation' (I corrected it already). – Tara B Feb 26 '13 at 19:15

No. For example, the monoid $\Sigma^*$ is a regular language, however certainly it contains subsets which are not regular.

share|cite|improve this answer

Just to elaborate a little on Boris's answer: every language over a finite alphabet $\Sigma$ is a sublanguage of the regular language $\Sigma^*$, so the definition of regular languages would be almost useless (it would just mean 'language over a finite alphabet') if it included sublanguages of languages accepted by finite automata.

An automaton $M$ accepts exactly one language: the language $L(M)$ defined in your question, i.e. the language of all words accepted by $M$. If $L\subset L(M)$, then $M$ accepts $w$ for every word $w\in L$, but does not accept the language $L$ unless $L = L(M)$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.