BlinkFill: Semi-supervised Programming By Example for Syntactic String Transformations Rishabh Singh Microsoft Research, Redmond, USA

First Page		Document Content
Date: 2018-06-25 09:59:57 Computing Formal languages Computer programming Mathematics String Substring Regular expression Rope Expr Hash function Recursion Longest common substring problem		BlinkFill: Semi-supervised Programming By Example for Syntactic String Transformations Rishabh Singh Microsoft Research, Redmond, USA Add to Reading List Source URL: rishabhmit.bitbucket.io Download Document from Source Website File Size: 1,92 MB Share Document on Facebook

	Perl regular expression puzzle: even zeros and odd ones Greg Bacon The challenge was to write a regular expression — subject to seemingly tight constraints: only literals, concatenation, Kleene star, DocID: 1vc3D - View Document
	Regular Expression Matching on Graphics Hardware for Intrusion Detection Giorgos Vasiliadis, Michalis Polychronakis, Spiros Antonatos, Sotiris Ioannidis, Evangelos P. Markatos FORTH-ICS, Greece DocID: 1v8HL - View Document
	Derivative-Based Diagnosis of Regular Expression Ambiguity Martin Sulzmann1 and Kenny Zhuo Ming Lu2 1 Karlsruhe University of Applied Sciences DocID: 1tI80 - View Document
	Fixing Regular Expression Matching Failure Martin Sulzmann1 and Kenny Zhuo Ming Lu2 1 Karlsruhe University of Applied Sciences DocID: 1tFZR - View Document