0
$\begingroup$

How many languages can a Regular Expression describe is it only one or infinite? I have tried to google it but i haven't found any answer?

I know that a Regular Expression describes a Regular Language?

Improve this question
$\endgroup$
1
  • $\begingroup$ One language, though there might be infinitely many strings described by a regular expression. $\endgroup$
    – Rick Decker
    May 12, 2021 at 17:05

3 Answers 3

Reset to default
3
$\begingroup$

If you look at the definition of regular expressions (they are usually defined in parallel to the language denoted) you see there is only one language denoted by a given expression. That language could be empty, finite or infinite, but that is another question.

Improve this answer
$\endgroup$
4
$\begingroup$

Every regular expression describes one language --- the language of words matched by the regular expression, or, in other words, the language of words accepted by the finite automaton corresponding to the regular expression.

Improve this answer
$\endgroup$
1
$\begingroup$

A language is described by a regular expression if and only if it is regular.

There are infinitely many regular languages over any fixed alphabet.

Improve this answer
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

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