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. 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
{"_id":"Ro2YGqE7CJqNEM7eF","bibbaseid":"fernau-kuppusamy-raman-onthecomputationalcompletenessofgraphcontrolledinsertiondeletionsystemswithbinarysizes-2017","downloads":0,"creationDate":"2018-10-01T13:54:48.686Z","title":"On the computational completeness of graph-controlled insertion-deletion systems with binary sizes","author_short":["Fernau, H.","Kuppusamy, L.","Raman, I."],"year":2017,"bibtype":"article","biburl":"https://dblp.org/pid/f/HenningFernau.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Henning"],"propositions":[],"lastnames":["Fernau"],"suffixes":[]},{"firstnames":["Lakshmanan"],"propositions":[],"lastnames":["Kuppusamy"],"suffixes":[]},{"firstnames":["Indhumathi"],"propositions":[],"lastnames":["Raman"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/tcs/FernauKR17,\n author = {Henning Fernau and\n Lakshmanan Kuppusamy and\n Indhumathi Raman},\n title = {On the computational completeness of graph-controlled insertion-deletion\n systems with binary sizes},\n journal = {Theor. Comput. Sci.},\n volume = {682},\n pages = {100--121},\n year = {2017},\n url = {https://doi.org/10.1016/j.tcs.2017.01.019},\n doi = {10.1016/j.tcs.2017.01.019},\n timestamp = {Wed, 28 Jun 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/tcs/FernauKR17},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Fernau, H.","Kuppusamy, L.","Raman, I."],"key":"DBLP:journals/tcs/FernauKR17","id":"DBLP:journals/tcs/FernauKR17","bibbaseid":"fernau-kuppusamy-raman-onthecomputationalcompletenessofgraphcontrolledinsertiondeletionsystemswithbinarysizes-2017","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.tcs.2017.01.019"},"downloads":0},"search_terms":["computational","completeness","graph","controlled","insertion","deletion","systems","binary","sizes","fernau","kuppusamy","raman"],"keywords":[],"authorIDs":[],"dataSources":["TuA7fGR5JYLK4NXQn"]}