![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Fernau Henning Kuppusamy Lakshmanan Raman Indhumathi
Publisher: Edp Sciences
E-ISSN: 1290-385x|52|1|1-21
ISSN: 0988-3754
Source: RAIRO - Theoretical Informatics and Applications, Vol.52, Iss.1, 2018-07, pp. : 1-21
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)
Insertion and deletion closure of languages
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-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)
![](/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)
Regular Description of Context-free Graph Languages
By Engelfriet J. van Oostrom V.
Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. :