String assembling systems: comparison to sticker systems and decidability

DOI10.1007/978-3-030-87993-8_7OpenAlexW3206744532MaRDI QIDQ2152089

Martin Kutrib, Matthias Wendlandt

Publication date: 6 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-87993-8_7

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• DNA computing, sticker systems, and universality
• Sticker systems
• Parametrizing string assembling systems
• Locally testable languages
• Bidirectional string assembling systems
• String Assembling Systems
• Algebraic decision procedures for local testability
• Developments in Language Theory
• A variant of a recursively unsolvable problem
• Marked PCP is decidable

This page was built for publication: String assembling systems: comparison to sticker systems and decidability