Author： Frid A.E.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 535-542
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
On images of D0L and DT0L power series
By Honkala J.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
A new bound for the D0L sequence equivalence problem
By Honkala Juha
Acta Informatica, Vol. 43, Iss. 6, 2007-01 ,pp. :
Automatic graphs and D0L-sequences of finite graphs
By Ly O.
Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. :
Watson-Crick D0L systems: generative power and undecidable problems
By Sosik P.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :