Author： Beaudry M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 299-317
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Stochastic Finite Learning of the Pattern Languages
Machine Learning, Vol. 44, Iss. 1-2, 2001-07 ,pp. :
The expressiveness of a family of finite set languages
By Immerman N. Patnaik S. Stemple D.
Theoretical Computer Science, Vol. 155, Iss. 1, 1996-02 ,pp. :
Minimal cover-automata for finite languages
By Campeanu C. Santean N. Yu S.
Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. :
A characterization of recognizable picture languages by tilings by finite sets
By Simplot D.
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :