On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. Fernau, H., Kuppusamy, L., & Raman, I. Theor. Comput. Sci., 682:100–121, 2017.
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes [link]Paper  doi  bibtex   
@article{DBLP:journals/tcs/FernauKR17,
  author    = {Henning Fernau and
               Lakshmanan Kuppusamy and
               Indhumathi Raman},
  title     = {On the computational completeness of graph-controlled insertion-deletion
               systems with binary sizes},
  journal   = {Theor. Comput. Sci.},
  volume    = {682},
  pages     = {100--121},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.tcs.2017.01.019},
  doi       = {10.1016/j.tcs.2017.01.019},
  timestamp = {Wed, 28 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/FernauKR17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0