[00:58:14] <woodruffw> i don't think you can, since i don't think that's expressable in a regular language
[01:18:40] *** Quits: vishwin (~alliek@wikimedia/O) (Quit: I'd advise against flashing anyone except your SO. Even kernel updates)
[01:35:52] *** Joins: vishwin (~alliek@wikimedia/O)
[17:43:03] <sivoais> Yeah, it's not possible. Been a while since I used the pumping lemma, but there are examples of this exact problem contradicting the pumping lemma online.
[17:43:42] <sivoais> It's not regular or context-free.
[17:43:53] <sivoais> s/or/nor/
[17:43:54] <yossarian-bot> sivoais probably meant: It's not regular nor context-free.
[18:02:19] <m0shbear> sivoais: what, L = { a b^n c | sqrt(n) in \N } and CFG pumping lemma?
[18:08:00] <sivoais> yeah, <http://planetmath.org/pumpinglemmacontextfreelanguages>
[18:08:01] <yossarian-bot> Title: pumping lemma (context-free languages) | planetmath.org
[19:12:20] <gsingh93> sivoais: we solved it
[19:12:45] <gsingh93> most regex engine these days can handle non-regular grammars
[19:31:47] <sivoais> right... I think you can even embed expressions in some which is scarily awesome
[20:19:24] <m0shbear> gsingh93: what was the regex for accepting perfect squares? you need to go into fun terroritory to escape CFG-ness
[20:21:23] <gsingh93> m0shbear: still working on it
[20:21:29] <gsingh93> we have a solution, but it's too long
[20:21:33] <gsingh93> we need to be less than 16 chars
[20:21:42] <gsingh93> ^(x(x*))(?=\1*$)(\2(?!\1+$))+$
[20:21:48] <gsingh93> this is ruby btw
[20:23:18] <m0shbear> oh god backreferencing lookaround
[20:23:23] * m0shbear gets the eye bleach
[21:12:35] <gsingh93> when asked about the tape released on friday: "we will take down ISIS" - trump
[21:12:39] <gsingh93> lol
[21:25:01] <sivoais> oh, is the debate happening now?
[21:26:04] <sivoais> I haven't watched any of the recent news. Giving up on following the election coverage.