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-languages
Search options not deleted
user 66948
Questions about properties of the class of regular languages and individual languages.
1
vote
0
answers
446
views
Regular Expression for All strings which contain no runs of a's of length greater than two.O... [closed]
My attempt is
We can fairly easily build an expression containing no a, one a, or one aa:
(b+c)(€+a+aa)(b+c)
but if we want to repeat this, we need to be sure to have at least one non-a between repe …
- 205
1
vote
0
answers
25
views
Regular Expressions & Minimum DFA [duplicate]
Suppose that we have been given a regular expression $L$ and then we are asked to calculate the minimum number of states in the minimum sized DFA?
How can we go about solving such questions?
What I t …
- 205