Author： Nishida T.Y. Salomaa A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.233, Iss.1, 2000-02, pp. : 279-286
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
Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. :
Access to resources
Recommend
On Parikh Slender Languages and Power Series
By Honkala J.
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :
On images of D0L and DT0L power series
By Honkala J.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Arithmetical complexity of symmetric D0L words
By Frid A.E.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :