Generalized nondeterministic finite automaton

Results: 5



#Item
1MCS 441 – Theory of Computation I Spring 2016 Problem Set 2 Lev Reyzin Due: at the beginning of class

MCS 441 – Theory of Computation I Spring 2016 Problem Set 2 Lev Reyzin Due: at the beginning of class

Add to Reading List

Source URL: homepages.math.uic.edu

Language: English - Date: 2016-02-03 00:14:14
2Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA

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

Language: English - Date: 2005-07-08 16:23:57
3Sequential 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

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

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2006-10-02 15:04:33
4

PDF Document

Add to Reading List

Source URL: www.cs.sunysb.edu

Language: English - Date: 2008-03-10 13:35:50
5

PDF Document

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2007-12-07 14:46:59