On Languages Piecewise Testable in the Strict Sense James Rogers1 , Jeffrey Heinz2⋆ , Gil Bailey1 , Matt Edlefsen1 , Molly Visscher1 , David Wellcome1 , and Sean Wibel1 1 - DFA minimization - Document - PDFSEARCH.IO

First Page	Meta Content
	On Languages Piecewise Testable in the Strict Sense James Rogers1 , Jeffrey Heinz2⋆ , Gil Bailey1 , Matt Edlefsen1 , Molly Visscher1 , David Wellcome1 , and Sean Wibel1 1 Add to Reading List Document Date: 2011-01-08 11:43:23 Open Document File Size: 155,79 KB Share Result on Facebook Company The Star / Heinz / / Currency pence / / Facility University of Delaware Research Fund Grant / University of Delaware Abstract / / IndustryTerm presents algorithms / natural language processing models / / Organization SL SP / Earlham College / University of Delaware Research Fund Grant / University of Delaware / T L / / Position author / / ProvinceOrState Delaware / / Technology 5 presents algorithms / natural language processing / / SocialTag Combinatorics on words Theoretical computer science Applied mathematics Regular language String Model theory Structure DFA minimization Formal languages Automata theory

On Languages Piecewise Testable in the Strict Sense James Rogers1 , Jeffrey Heinz2⋆ , Gil Bailey1 , Matt Edlefsen1 , Molly Visscher1 , David Wellcome1 , and Sean Wibel1 1Add to Reading List