Author： Steinby M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.205, Iss.1, 1998-08, pp. : 1-43
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
Stochastic Inference of Regular Tree Languages
Machine Learning, Vol. 44, Iss. 1-2, 2001-07 ,pp. :
Access to resources
Recommend
A gap property of deterministic tree languages
Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. :
Tree-based generation of languages of fractals
By Drewes F.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
Implicitization of a General Union of Parametric Varieties
By Orecchia F.
Journal of Symbolic Computation, Vol. 31, Iss. 3, 2001-03 ,pp. :
An algebraic characterization of frontier testable tree languages
By Wilke T.
Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. :