1
$\begingroup$

I know that if a language has a regular expression it is regular, is the other way also true?

$\endgroup$

closed as unclear what you're asking by Raphael Oct 3 '16 at 19:13

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ Since this is general reference knowledge (available in any textbook and even Wikipedia) to the point of being true by definition, it is unclear what your question is. Please clarify. $\endgroup$ – Raphael Oct 3 '16 at 19:14
2
$\begingroup$

Yes, a language can be described as a (pure vanilla) regular expression if and only if it is regular. You can see the proof in any decent textbook on formal languages.

$\endgroup$

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