![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Okhotin A.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 663-685
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)
Characterization and closure properties of linear -languages
By Mihoubi D.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The Boolean closure of linear context-free languages
Acta Informatica, Vol. 45, Iss. 3, 2008-05 ,pp. :
![](/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)
Insertion and deletion closure of languages
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :