Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA

First Page		Document Content
Date: 2005-07-08 16:23:57 Applied mathematics Nondeterministic finite automaton Regular expression Deterministic finite automaton Regular language Preorder Generalized nondeterministic finite automaton ReDoS Automata theory Theoretical computer science Computer science		Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA Add to Reading List Source URL: www.cs.ucr.edu Download Document from Source Website File Size: 110,20 KB Share Document on Facebook

	MCS 441 – Theory of Computation I Spring 2016 Problem Set 2 Lev Reyzin Due: at the beginning of class DocID: 1psv0 - View Document
	Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA DocID: 15g6u - View Document
	Sequential Synthesis with Co-Büchi Specifications Guoqiang Wang, Alan Mishchenko, Robert Brayton, and Alberto Sangiovanni-Vincentelli EECS Dept. University of California Berkeley, California, 94720, USA {geraldw, alanmi DocID: NYwY - View Document
	PDF Document DocID: 18kW - View Document
	PDF Document DocID: Xir - View Document