Timeline for Union of finite and non-regular language [duplicate]
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 30, 2015 at 10:26 | history | closed |
D.W.♦ Juho David Richerby R B Raphael |
Duplicate of How to prove that a language is not regular? | |
Jan 30, 2015 at 10:25 | history | edited | Raphael |
edited tags
|
|
S Jan 29, 2015 at 20:39 | history | suggested | lucasoliveira | CC BY-SA 3.0 |
Latex Edit
|
Jan 29, 2015 at 19:09 | review | Suggested edits | |||
S Jan 29, 2015 at 20:39 | |||||
Jan 26, 2015 at 22:53 | review | Close votes | |||
Jan 30, 2015 at 10:30 | |||||
Jan 26, 2015 at 22:36 | comment | added | D.W.♦ | We expect you to make a serious effort before asking here. What methods do you know for proving a language isn't regular? Have you tried each of them? Where did you get stuck, specifically? It looks like you need to make more of an effort on your own -- your textbook will have many worked examples of techniques for proving that specific languages are not regular. So, spend some time trying each one. P.S. I recommend you get clearer on the difference between "$C \cup B$ isn't necessarily regular" vs "$C \cup B$ is never regular". | |
Jan 23, 2015 at 15:58 | answer | added | Dave Clarke | timeline score: 5 | |
Jan 23, 2015 at 15:12 | history | edited | Dave Clarke | CC BY-SA 3.0 |
deleted 14 characters in body
|
Jan 23, 2015 at 15:08 | history | asked | jreing | CC BY-SA 3.0 |