Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with regular-expressions
Search options not deleted
user 105873
Questions about regular expressions, a formalism to describe regular languages.
0
votes
1
answer
35
views
If a person accidentally deletes a few letters when they try to type "IDAHO" or "ILLIONOIS",...
The Short Version of my Question
The following two regular expressions represent two sets of strings.
REGEX
EXAMPLES OF STRINGS OF TEXT THAT MATCH THE REGEX
I?D?A?H?O?
“IDAHO”“ID”“IDH”“IDAHO”
…
1
vote
1
answer
39
views
How do you convert a string representing a finite set of strings into a regulair expression ...
Consider the following string:
stryng = "{\"Jordi\", \"Jordy\", \"Jorde\", \"Jordie\", \"Jordee\", \"Joardi\", \"Joardy\", \"Joarde\", \"Joardie\", \"Joardee\"}"
That string represents a mathematical …
0
votes
0
answers
111
views
What algorithm will convert a regex into a tree of predictable size?
How do we quantify the size of a regular expression?
A problem in computer science which sometimes arises is converting a regular expression into a tree.
What rules can we use to ensure that the tree …
0
votes
1
answer
31
views
What algorithm accepts a set of strings as input and outputs a regex of minimal size?
We seek an algorithm.
Inputs to the algorithm are a set of strings $A$ and the output of the algorithm $A$ is a regular expression $r$ such that:
The size of regular expression $r$ is minimized.
If …
0
votes
0
answers
14
views
What algrorithm computes a mutally exclusive partitioning from two regulair expressions?
The Question
A regular expression, such as AL+[EYI]+, represents a set of strings.
alleys = {
“ALY”,
“ALLEY”,
“ALLY”,
“ALLEE”,
et cetra...
}
Let $\mathbb{AS}$ be the set of a …