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 7240
Questions related to formal languages, grammars, and automata theory
3
votes
Grammar that numbers of letters `c` is greater than number of letters `b`
Your grammar never accepts a word since you can't make the $S$ disappear.
If you want to create more $c$ than $b$ you just have to make sure that when you create a $b$ you create a $c$ with it (but …
- 748
1
vote
Accepted
Is the following language context free?
$L$ is not context free. You can use the Ogden's lemma to show it.
I'll use the Wikipedia notation linked above.
For every $p$ take the word $a^pb^pc^p$. For a the marking where only c are marked wh …
- 748
0
votes
How to convert NFA with null moves to NFA without null moves?
Simply put, you do exactly as you said. If $q_j$ does not contain any transition you don't have anything to do so you do nothing more than removing $q_j$ and updating $q_i$ as final if $q_j$ is final. …
- 748
5
votes
Can this grammar be simplified?
Your grammar will generate:
$S\rightarrow 0S12\rightarrow 00S1212\rightarrow 001212$ which is not in the required language.
- 748