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-grammars
Search options not deleted
user 11632
Questions about formal grammars, generative descriptions of formal languages.
-1
votes
1
answer
149
views
L is a regular language and w is any word, not necessarily in L. Show that L is regular
$L$ is a regular language and $w$ is any word, not necessarily in $L$. We define the set as
$$L/w = \{x \in \Sigma ^* \mid xw \in L\}.$$
Show that $L/w$ is regular.
I'm really struggling with this …
- 49