On the computational power of insertion-deletion systems

Author： Takahara Akihiro   Yokomori Takashi  

Publisher： Springer Publishing Company

ISSN： 1567-7818

Source： Natural Computing, Vol.2, Iss.4, 2003-01, pp. : 321-336

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Computational power of insertion-deletion (P) systems with rules of size two

By Krassovitskiy Alexander  

Natural Computing, Vol. 10, Iss. 2, 2011-06 ,pp. : 835-852

Springer Publishing Company

Access to resources Recommend Favorite

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

By Fernau Henning   Kuppusamy Lakshmanan   Raman Indhumathi  

RAIRO - Theoretical Informatics and Applications, Vol. 52, Iss. 1, 2018-07 ,pp. : 1-21

Edp Sciences

Access to resources Recommend Favorite

On the computational power of self-stabilizing systems

By Abello J.   Dolev S.  

Theoretical Computer Science, Vol. 182, Iss. 1, 1997-08 ,pp. : 159-170

Elsevier

Access to resources Recommend Favorite

Insertion and deletion closure of languages

By Ito M.   Kari L.   Thierrin G.  

Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. : 3-19

Elsevier

Access to resources Recommend Favorite

On the computational power of dynamical systems and hybrid systems

By Bournez O.   Cosnard M.  

Theoretical Computer Science, Vol. 168, Iss. 2, 1996-11 ,pp. : 417-459

Elsevier

Access to resources Recommend Favorite