![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Fernau H.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 425-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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Learning deterministic even linear languages from positive examples
By Koshiba T. Makinen E. Takada Y.
Theoretical Computer Science, Vol. 1336, Iss. 2, 1997-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Characterization and closure properties of linear -languages
By Mihoubi D.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :