Author： Selivanov V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.191, Iss.1, 1998-01, pp. : 37-59
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
Regular component decomposition of regular languages
By Liu Y.J.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
Access to resources
Recommend
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. :
Regular binoid expressions and regular binoid languages
By Hashiguchi K. Wada Y. Jimbo S.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
A hierarchy of deterministic context-free -languages
By Duparc J.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :