To test equivalence you can compute the minimal DFAs for the expressions and compare them.
More Related Contents:
- Regular expression [ 1 ( 0 1* 0)* 1 ]* DFA
- What’s the Time Complexity of Average Regex algorithms?
- Finding the complement of a DFA?
- Grammatical inference of regular expressions for given finite list of representative strings?
- US Phone Number Verification
- Design DFA accepting binary strings divisible by a number ‘n’
- Learning Regular Expressions [closed]
- Regular expression for floating point numbers
- RegEx for matching UK Postcodes
- Can’t escape the backslash with regex?
- Regex to match URL
- Regex (grep) for multi-line search needed [duplicate]
- Extracting a string between other two strings in R
- Regular expression for matching HH:MM time format
- What is the difference between square brackets and parentheses in a regex?
- isnumeric() with PostgreSQL
- How do I use regular expressions in bash scripts?
- Insert commas into number string
- Insert contents of a file after specific pattern match
- regex to match a word with unique (non-repeating) characters
- Regex: match pattern as long as it’s not in the beginning
- How can I make my match non greedy in vim?
- What are the differences between glob-style patterns and regular expressions?
- Regex for comments in strings, strings in comments, etc
- How do I handle special characters in a Perl regex?
- Use gsub remove all string before first white space in R
- Can a URL contain a semicolon and still be valid?
- How can I find the location of a regex match in Perl?
- How to define a regex-matched string type in Typescript?
- Question marks in regular expressions