Timeline for Unrestricted grammar for the language of strings whose length is not $2^n$
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 31, 2015 at 9:09 | answer | added | Raphael | timeline score: 2 | |
| Oct 31, 2015 at 9:07 | history | edited | Raphael |
edited tags
|
|
| Oct 30, 2015 at 22:41 | history | edited | Sid | CC BY-SA 3.0 |
deleted 2 characters in body; edited title
|
| Oct 30, 2015 at 22:26 | comment | added | Sid | @D.W. That is very understandable. | |
| Oct 30, 2015 at 22:20 | history | edited | Sid | CC BY-SA 3.0 |
added 91 characters in body
|
| Oct 30, 2015 at 22:17 | comment | added | D.W.♦ | At minimum, I suggest editing the question to include that information in the question. (As a side note, "please check whether my solution is correct" questions are usually discouraged here,as only "yes/no" answers are possible, which won't help you or future visitors. See here and here.) | |
| Oct 30, 2015 at 22:13 | comment | added | Sid | Thanks @D.W. My question is really threefold; (i) is the unrestricted grammar that I posted correct? (ii) do there exists better examples than the one I posted? (iii) what is a restriction-free grammar for the complement of L?. But of those questions, I am mostly interested in (iii) and the discussion leading up to it mostly intended for background information. | |
| Oct 30, 2015 at 21:56 | comment | added | D.W.♦ | Also, it's usually preferable to ask only one question per question, if possible. It sounds like you have two questions "is there another grammar for $L$?" and "is there a grammar for $\overline{L}$?". While those are indeed related, when someone posts an answer that answers one of those two questions but not the other, the situation is a bit less than ideal -- now the question gets marked as answered. Not a disaster, certainly, but it illustrates that the Stack Exchange software/format might work a bit better when you have one question per question. Just trying to help you get good answers. | |
| Oct 30, 2015 at 21:53 | comment | added | D.W.♦ | Can you edit the question to be clearer about what specifically your question is? It sounds like your question is "are there other examples of unrestricted grammars for the language?", but the answer to that is a trivial and boring "yes" (for instance, replace the rule $1X \to \epsilon$ with the two rules $1X \to Y$ and $Y \to \epsilon$), so I suspect that's not really what you mean to ask. Maybe you can identify some sense in which the solution you have is not satisfactory, and then ask "is there an unrestricted grammar that has property P?", where you specify what P is. | |
| Oct 30, 2015 at 21:52 | answer | added | advocateofnone | timeline score: 2 | |
| Oct 30, 2015 at 20:00 | history | edited | Sid | CC BY-SA 3.0 |
edited body
|
| Oct 30, 2015 at 19:11 | history | edited | Sid | CC BY-SA 3.0 |
edited body
|
| Oct 30, 2015 at 19:04 | review | First posts | |||
| Oct 30, 2015 at 20:56 | |||||
| Oct 30, 2015 at 19:03 | history | asked | Sid | CC BY-SA 3.0 |