Author： Germain C.C. Pallo J.J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.233, Iss.1, 2000-02, pp. : 217-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
Access to resources
Recommend
Counting with range concatenation grammars
By Boullier P.
Theoretical Computer Science, Vol. 293, Iss. 2, 2003-02 ,pp. :
Algebraic tools for the concatenation product
By Pin J.-E.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :
Long words: the theory of concatenation and -power
By Bloom
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
A Course in Computational Nonassociative Algebra
By Jacobs D.P.
Journal of Symbolic Computation, Vol. 23, Iss. 5, 1997-05 ,pp. :