Reducing control alphabet size for the control of right linear grammars with unknown behaviors

DOI10.1016/J.TCS.2020.11.051zbMath1497.68244OpenAlexW3111495636MaRDI QIDQ1998876

Nobuya Kimoto, Satoshi Kobayashi, Shigetaka Nakamura, Ken Komiya, Kenzo Fujimoto

Publication date: 9 March 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.051

zbMATH Keywords

DNA computingregulated rewritingDNA nano-structureright linear grammar with unknown behavior

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experimental validation and optimization of signal dependent operation in whiplash PCR
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Computing with membranes
• Monotonically controlling right linear grammars with unknown behaviors to output a target string
• Control sets on grammars
• Programmed Grammars and Classes of Formal Languages
• Periodically time-variant context-free grammars

This page was built for publication: Reducing control alphabet size for the control of right linear grammars with unknown behaviors