scientific article; zbMATH DE number 7488328

MaRDI QIDQ5061519

Jose Angel Sanchez Martin, Andrei Păun, Mihaela Păun, Victor Mitrana

Publication date: 11 March 2022

Full work available at URL: http://www.jalc.de/issues/2021/issue_26_1-2/jalc-2021-109-124.php

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Turing machine2-tag systemaccepting splicing systemnon-preserving splicing

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Networks of splicing processors: simulations between topologies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accepting splicing systems
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• DNA computing based on splicing: The existence of universal computers
• Small universal Turing machines
• Computing by splicing
• Regularity of splicing languages
• Accepting splicing systems with permitting and forbidding words
• Complexity theory for splicing systems
• Regular splicing languages and subclasses
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• Non-preserving splicing with delay
• DNA Computing
• Universality of Tag Systems with P = 2
• Formal Reductions of the General Combinatorial Decision Problem

This page was built for publication: