Learning Fallible Deterministic Finite Automata

Author： Ron D.  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.18, Iss.2-3, 1995-02, pp. : 149-185

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

Deterministic generalized automata

By Giammarresi D.   Montalbano R.  

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 191-208

Elsevier

Access to resources Recommend Favorite

Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning

By Dean T.  

Machine Learning, Vol. 18, Iss. 1, 1995-01 ,pp. : 81-108

Springer Publishing Company

Access to resources Recommend Favorite

Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle

By Angluin D.  

Machine Learning, Vol. 14, Iss. 1, 1994-01 ,pp. : 7-26

Springer Publishing Company

Access to resources Recommend Favorite

ROUGH FINITE-STATE AUTOMATA

By BASU SUMITA  

Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. : 107-124

Taylor & Francis Ltd

Access to resources Recommend Favorite