Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems-Reference-Cited by-同舟云学术

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems

Published:2017 Issue: Volume: Page:89-100
ISSN:0302-9743
Container-title:Implementation and Application of Automata
language:
Short-container-title:

Author:

Fernau Henning,Kuppusamy Lakshmanan,Raman Indhumathi

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-60134-2_8

Reference16 articles.

1. Molecular Biology,1993

2. Fernau, H.: An essay on general grammars. J. Automata Lang. Comb. 21, 69–92 (2016)

3. Lecture Notes in Computer Science;H Fernau,2017

4. Fernau, H., Kuppusamy, L., Raman, I.: Generative power of graph-controlled ins-del systems with small sizes. Accepted with J. Automata Lang. Comb. (2017)

5. Fernau, H., Kuppusamy, L., Raman, I.: On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. Accepted with Theor. Comput. Sci. (2017). http://dx.doi.org/10.1016/j.tcs.2017.01.019

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Analyzing the Trade-Off Between Complexity Measures, Ambiguity in Insertion System and Its Applications;IEEE Access;2022

2. On the generative capacity of matrix insertion-deletion systems of small sum-norm;Natural Computing;2021-09-08

3. On Matrix Ins-Del Systems of Small Sum-Norm;SOFSEM 2019: Theory and Practice of Computer Science;2019

4. On path-controlled insertion–deletion systems;Acta Informatica;2018-02-05

5. On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems;RAIRO - Theoretical Informatics and Applications;2018-01