Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems. Fernau, H., Kuppusamy, L., & Raman, I. In Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings, pages 89–100, 2017.
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/wia/FernauKR17,
  author    = {Henning Fernau and
               Lakshmanan Kuppusamy and
               Indhumathi Raman},
  title     = {Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion
               Systems},
  booktitle = {Implementation and Application of Automata - 22nd International Conference,
               {CIAA} 2017, Marne-la-Vall{\'{e}}e, France, June 27-30, 2017, Proceedings},
  pages     = {89--100},
  year      = {2017},
  crossref  = {DBLP:conf/wia/2017},
  url       = {https://doi.org/10.1007/978-3-319-60134-2\_8},
  doi       = {10.1007/978-3-319-60134-2\_8},
  timestamp = {Tue, 20 Jun 2017 13:55:34 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wia/FernauKR17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0