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 17107
Questions about formal grammars, generative descriptions of formal languages.
2
votes
Gyorgy E. ReveszExercise 1.1: Show the grammar $G$ generates the language $L$
Ok, so here's my attempt at a solution, after not having looked at the problem since April. I think this is on the right track.
Given Yuval's helpful comment, we are to show
(1) that every word $w$ …
- 213
4
votes
2
answers
181
views
Gyorgy E. ReveszExercise 1.1: Show the grammar $G$ generates the language $L$ [duplicate]
The exercise says
"Show that the grammar $G = \langle\{S\}, \{a, b\}, S, \{S \to \lambda, S \to aSb\}\rangle$
generates the language $L = \{a^i b^i \mid i = 0, 1, 2, \ldots\}$."
Now, I'm new to th …
- 213