Author： Niwinski D. Walukiewicz I.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.303, Iss.1, 2003-06, pp. : 215-231
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
A hierarchy of deterministic context-free -languages
By Duparc J.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
A topological property of rational -languages
By Arnold A.
Theoretical Computer Science, Vol. 151, Iss. 1, 1995-11 ,pp. :
General varieties of tree languages
By Steinby M.
Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. :
Polynomial Time Learnability of Simple Deterministic Languages
By Ishizaka H.
Machine Learning, Vol. 05, Iss. 2, 1990-06 ,pp. :
Compositions with superlinear deterministic top-down tree transformations
Theoretical Computer Science, Vol. 194, Iss. 1, 1998-03 ,pp. :