Author： Bertoni A. Choffrut C. Goldwurm M. Lonati V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.302, Iss.1, 2003-06, pp. : 431-456
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 the number of occurrences of all short factors in almost all words
By Tomescu I.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
Regular component decomposition of regular languages
By Liu Y.J.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
On the acceptance power of regular languages
By Borchert B.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :
On the entropy of regular languages
By Ceccherini-Silberstein T. Machi A. Scarabotti F.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
Fine hierarchy of regular -languages
By Selivanov V.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :