Page not found
This question was removed from Computer Science Stack Exchange for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- Compare regex in programming languages with regular expression from automata/formal language?
- $L_n = \{x \in \Sigma^{*} | \exists w, y, z \in \Sigma^*, x = ywz, w^r = w, |w| = n \}$ Informally x is palindrome of length n. Find regex for n = 1
- Why is there no permutation in Regexes? (Even if regular languages seem to be able to do this)
- Theory behind regex implementations
- Is regex with lookaround still regular?
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.