![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Denis F. Lemay A. Terlutte A.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.313, Iss.2, 2004-02, pp. : 267-294
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
![](/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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Learning Regular Languages from Simple Positive Examples
By Denis F.
Machine Learning, Vol. 44, Iss. 1-2, 2001-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Efficient implementation of regular languages using reversed alternating finite automata
By Salomaa K. Wu X. Yu S.
Theoretical Computer Science, Vol. 231, Iss. 1, 2000-01 ,pp. :
![](/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 acceptance power of regular languages
By Borchert B.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :