![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Borchert B.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.148, Iss.2, 1995-09, pp. : 207-225
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)
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)
On the entropy of regular languages
By Ceccherini-Silberstein T. Machi A. Scarabotti F.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Fine hierarchy of regular -languages
By Selivanov V.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Regular binoid expressions and regular binoid languages
By Hashiguchi K. Wada Y. Jimbo S.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Learning approximately regular languages with reversible languages
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :