Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems

Sergey Verlan; Sergiu Ivanov

doi:10.3233/FI-2017-1580

Journal articles

Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems

Sergey Verlan ¹ Sergiu Ivanov ¹

1 LACL - Laboratoire d'Algorithmique Complexité et Logique

Document type :

Journal articles

Domain :

Computer Science [cs] / Formal Languages and Automata Theory [cs.FL]

Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01638789
Contributor : Sergey Verlan Connect in order to contact the contributor
Submitted on : Monday, November 20, 2017 - 11:14:57 AM
Last modification on : Thursday, February 10, 2022 - 11:48:03 PM

Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems

Identifiers

Collections

Citation

Export

Metrics

46

Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems

Identifiers

Collections

Citation

Export

Share

Metrics

46