Timeline for How to prove for that a given non-regular language its given super-set is also non-regular? [duplicate]
Current License: CC BY-SA 3.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 25, 2015 at 14:13 | history | closed |
David Richerby CommunityBot |
Duplicate of How to prove that a language is not regular? | |
| Sep 25, 2015 at 13:55 | vote | accept | letsBeePolite | ||
| Sep 25, 2015 at 13:51 | comment | added | letsBeePolite | But my worry is that proof correct? that I did using Myhill-Nerode | |
| Sep 25, 2015 at 12:50 | review | Close votes | |||
| Sep 25, 2015 at 14:18 | |||||
| Sep 25, 2015 at 11:59 | answer | added | J.-E. Pin | timeline score: 5 | |
| Sep 25, 2015 at 8:20 | comment | added | Yuval Filmus | The easiest proof is using Myhill–Nerode, as you outline. | |
| Sep 25, 2015 at 6:39 | comment | added | Raphael | Hint: use closure properties. Details are in the question linked by D.W. | |
| Sep 25, 2015 at 6:39 | comment | added | letsBeePolite | Yes, thanks for editing. Will keep in mind henceforth. | |
| Sep 25, 2015 at 4:59 | history | reopened | D.W.♦ | ||
| Sep 25, 2015 at 4:59 | comment | added | D.W.♦ | Please take a look at my edit. Does it accurately reflect your problem? | |
| Sep 25, 2015 at 4:57 | history | edited | D.W.♦ | CC BY-SA 3.0 |
Clean up definition of L and some language.
|
| Sep 25, 2015 at 0:51 | review | Reopen votes | |||
| Sep 25, 2015 at 5:01 | |||||
| Sep 25, 2015 at 0:46 | history | edited | letsBeePolite | CC BY-SA 3.0 |
added 471 characters in body
|
| Sep 25, 2015 at 0:34 | history | edited | letsBeePolite | CC BY-SA 3.0 |
added 471 characters in body
|
| Sep 25, 2015 at 0:25 | history | closed | D.W.♦ | Needs details or clarity | |
| Sep 25, 2015 at 0:24 | comment | added | D.W.♦ | 1. It's not clear to me what your language $L$ is. Please edit. I'll put this on hold to give you a chance to clarify. 2. Isn't this already covered by cs.stackexchange.com/q/1031/755? Is there a reason this is not a duplicate? 3. What have you tried? Have you tried the techniques listed there? We discourage posts that simply state a problem out of context, and expect the community to solve it. Assuming you tried to solve it yourself and got stuck, it'd be helpful if you wrote your thoughts and what you could not figure out. We're not here to solve your exercises for you. | |
| Sep 25, 2015 at 0:06 | history | asked | letsBeePolite | CC BY-SA 3.0 |