![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Hashiguchi K. Wada Y. Jimbo S.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 291-313
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Regular component decomposition of regular languages
By Liu Y.J.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Rewriting extended regular expressions
Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the acceptance power of regular languages
By Borchert B.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the entropy of regular languages
By Ceccherini-Silberstein T. Machi A. Scarabotti F.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :