Monotonically controlling right linear grammars with unknown behaviors to output a target string

DOI10.1016/j.tcs.2019.01.009zbMath1423.68232OpenAlexW2908537632WikidataQ128559039 ScholiaQ128559039MaRDI QIDQ2422039

Satoshi Kobayashi, Ken Komiya, Nobuya Kimoto, Kenzo Fujimoto

Publication date: 18 June 2019

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

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

zbMATH Keywords

DNA computingregulated rewritingformal grammarsDNA nano-structure

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Grammars and rewriting systems (68Q42)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Control sets on grammars
• Programmed Grammars and Classes of Formal Languages
• Periodically time-variant context-free grammars