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 formal-languages
Search options not deleted
user 27212
Questions related to formal languages, grammars, and automata theory
8
votes
Find a regular language that is "infinitely between" two other regular languages
Because regular languages are closed under complement and intersection, $L_2 - L_1$ is regular. Because it's also infinite, it contains words of arbitrarily large lengths.
Therefore, by the pumping l …
- 633
0
votes
Finding a regular expression for all non-empty binary strings that contain both 0s and 1s bu...
Starting from what you have, let's try to improve it.
So you have $(0+10)^*(ε+1)$. That's a very good start, as it covers all binary strings with no consecutive 1s. I think of this as saying that a b …
- 633
1
vote
Proving/Disproving that language L is non-regular/CFL
For regular languages, my go-to tool is the Myhill-Nerode theorem. Sometimes, for explicitly proving that a language is non-regular, I reach for the pumping lemma.
So my first instincts would be to r …
- 633