On the computational completeness of graph-controlled insertion-deletion systems with binary sizes

From MaRDI portal

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_the_computational_completeness_of_graph-controlled_insertion-deletion_systems_with_binary_sizes&oldid=73996926"