On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

By Yokomori T.  

Machine Learning, Vol. 19, Iss. 2, 1995-05 ,pp. : 153-179

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-time learnability of logic programs with local variables from entailment

By Krishna Rao M.R.K.   Sattar A.  

Theoretical Computer Science, Vol. 268, Iss. 2, 2001-10 ,pp. : 179-198

Elsevier

Access to resources Recommend Favorite

A Polynomial-Time Parsing Algorithm for K -Depth Languages

By Cherubini A.   San Pietro P.  

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 61-79

Academic Press

Access to resources Recommend Favorite

Polynomial-time identification of very simple grammars from positive data

By Yokomori T.  

Theoretical Computer Science, Vol. 298, Iss. 1, 2003-04 ,pp. : 179-206

Elsevier

Access to resources Recommend Favorite

A gap property of deterministic tree languages

By Niwinski D.   Walukiewicz I.  

Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. : 215-231

Elsevier

Access to resources Recommend Favorite