APPROXIMATE MATCHING OF REGULAR EXPRESSIONS EUGENE W. MYERS† Department of Computer Science University of Arizona Tucson, AZ 85721

First Page		Document Content
Date: 2006-03-21 10:39:03 Models of computation Mathematics Symbol Nondeterministic finite automaton Formal languages Cycle rank Ε-quadratic form Graph theory Theoretical computer science Automata theory		APPROXIMATE MATCHING OF REGULAR EXPRESSIONS EUGENE W. MYERS† Department of Computer Science University of Arizona Tucson, AZ 85721 Add to Reading List Source URL: www.cs.mun.ca Download Document from Source Website File Size: 126,48 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document