212 formalised include: the Myhill-Nerode theorem, the closure of regular languages |
212 formalised include: the Myhill-Nerode theorem, the closure of regular languages |
213 under complementation, finiteness of derivatives of regular expressions and a surprising |
213 under complementation, finiteness of derivatives of regular expressions and a surprising |
214 result about Subseq, which according to |
214 result about Subseq, which according to |
215 this |
215 this |
216 <A HREF="http://blog.computationalcomplexity.org/2006/01/theorem-that-should-be-better-known.html">blog</A> |
216 <A HREF="http://blog.computationalcomplexity.org/2006/01/theorem-that-should-be-better-known.html">blog</A> |
217 should be better known. This is joint work with Prof. Xingyuan |
217 should be better known. We also answered a |
|
218 <A HREF="http://blog.computationalcomplexity.org/2013/02/proving-dfa-langs-closed-under-concat.html">question</A> by Bill Gasarch from the same blog about |
|
219 "proving Reg-exp-langs [being] closed under complementation without using equiv to DFA's"....yes we can! |
|
220 This is joint work with Prof. Xingyuan |
218 Zhang and his student Chunhan Wu from the |
221 Zhang and his student Chunhan Wu from the |
219 <A HREF="http://www.ust.com.cn/">PLA University of Science and Technology</A> in Nanjing. |
222 <A HREF="http://www.ust.com.cn/">PLA University of Science and Technology</A> in Nanjing. |
220 My funding for this work came from the |
223 My funding for this work came from the |
221 <A HREF="http://www.sinogermanscience.org.cn/">Chinese-German Research Centre</A>. |
224 <A HREF="http://www.sinogermanscience.org.cn/">Chinese-German Research Centre</A>. |
222 </TD> |
225 </TD> |