Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs

By Iwama K.   Kambayashi Y.   Takaki K.  

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 485-494

Elsevier

Access to resources Recommend Favorite

Reducing NFAs by invariant equivalences

By Ilie L.   Yu S.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 373-390

Elsevier

Access to resources Recommend Favorite

On the representation of finite deterministic 2-tape automata

By Pelletier M.   Sakarovitch J.  

Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. : 1-63

Elsevier

Access to resources Recommend Favorite

Thesaurus or Logical Ontology, Which One Do We Need for Text Mining?

By Tsujii Junichi   Ananiadou Sophia  

Language Resources and Evaluation, Vol. 39, Iss. 1, 2005-02 ,pp. : 77-90

Springer Publishing Company

Access to resources Recommend Favorite

Deterministic summation modulo B n , the semigroup of binary relations on {0, 1&unknown;n - 1}

By Handley W.G.  

Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. : 135-174

Elsevier

Access to resources Recommend Favorite