![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Ito M. Kari L. Thierrin G.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.183, Iss.1, 1997-08, pp. : 3-19
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)
Shuffle and scattered deletion closure of languages
Theoretical Computer Science, Vol. 245, Iss. 1, 2000-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the computational power of insertion-deletion systems
By Takahara Akihiro Yokomori Takashi
Natural Computing, Vol. 2, Iss. 4, 2003-01 ,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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the closure properties of linear conjunctive languages
By Okhotin A.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :