Minimal cover-automata for finite languages

By Campeanu C.   Santean N.   Yu S.  

Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. : 3-16

Elsevier

Access to resources Recommend Favorite

Generalized acceptance, succinctness and supernondeterministic finite automata

By van Zijl L.  

Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. : 159-172

Elsevier

Access to resources Recommend Favorite

Enumerating Minimal Subset Feedback Vertex Sets

By Fomin Fedor   Heggernes Pinar   Kratsch Dieter   Papadopoulos Charis   Villanger Yngve  

Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. : 216-231

Springer Publishing Company

Access to resources Recommend Favorite

Self-stabilizing algorithms for minimal dominating sets and maximal independent sets

By Hedetniemi S.M.   Hedetniemi S.T.   Jacobs D.P.   Srimani P.K.  

Computers and Mathematics with Applications, Vol. 46, Iss. 5, 2003-09 ,pp. : 805-811

Elsevier

Access to resources Recommend Favorite

A View on Fuzzy Minimal Open Sets and Fuzzy Maximal Open Sets

By  

International Journal of Software Science and Computational Intelligence (IJSSCI), Vol. 7, Iss. 1, 2015-01 ,pp. : 62-73

IGI Global_journal

Access to resources Recommend Favorite