String assembling systems: origins and directions

DOI10.1007/978-3-031-97274-4_13MaRDI QIDQ6877481zbMATH OpenFDO

Authors Martin Kutrib, Matthias Wendlandt

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-97274-4_13

zbMATH Keywords

closure propertiesdecidabilitydouble-stranded sequencesstatelessstring assemblingtwo-head finite automata

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Cites work

• k + 1 Heads Are Better than k
• A variant of a recursively unsolvable problem
• Algebraic decision procedures for local testability
• Bidirectional string assembling systems
• Complexity of multi-head finite automata: origins and directions
• DNA computing, sticker systems, and universality
• Expressive capacity of subregular expressions
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 6665209 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Locally testable languages
• Marked PCP is decidable
• On non-determinacy in simple computing devices
• On stateless multihead automata: hierarchies and the emptiness problem
• On the power of small Watson-Crick automata and variants of string assembling systems
• Set automata
• Sticker systems
• String assembling systems
• String assembling systems: comparison to sticker systems and decidability
• The Frobenius Problem and Its Generalizations

This page was built for publication: String assembling systems: origins and directions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877481)