Home/ Questions/Q 9254725
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-18T11:32:37+00:00

I am curious if there is such a regular expression which defines all possible

  • 0

I am curious if there is such a regular expression which defines all possible regular expressions. Since there are escape characters that might appear in an RE, it would be tricky to denote such characters in another, say validator, RE since RE’s are primarily to describe sequences of alphanumerical characters.

My question can be analogously interpreted as if there is a finite automata which is able to decide a finite-autmata candidate is an FA or not. This is because we know that FA’s can be designed in such a way that it rules out a given input string matches the pattern which by the FA is defined or not. So, If we somehow can define everything(FA candidates) as strings, we would be able to define an FA which validates that input is an FA or not. However, I don’t know how can I prove this claim, I would be happy if you helped me how I can prove it.

Thanks in advance

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    To be able to decide if a RE is “legit”, you would need to be able to “count parentheses” to check they are balanced, which you can NOT do with a RE (or FA).

    • 0