$$5'\rightarrow 3'$$ Watson–Crick automata languages-without sensing parameter-Reference-Cited by-同舟云学术

$$5'\rightarrow 3'$$ Watson–Crick automata languages-without sensing parameter

Published:2021-08-18 Issue: Volume: Page:
ISSN:1567-7818
Container-title:Natural Computing
language:en
Short-container-title:Nat Comput

Author:

Nagy Benedek^ORCID,Parchami Shaghayegh

Publisher

Springer Science and Business Media LLC

Subject

Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s11047-021-09869-9.pdf

Reference28 articles.

1. Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 226:1021–1024

2. Amar V, Putzolu GR (1964) On a family of linear grammars. Inform Control 7:283–291

3. Csuhaj-Varjú E, Freund R, Vaszil Gy (2015) A connection between red-green turing machines and Watson–Crick T0L Systems. MCU 31–44

4. Czeizler E, Czeizler EA (2006) Short survey on Watson–Crick automata. Bull EATCS 88:104–119

5. Freund R, Păun G, Rozenberg G, Salomaa A (1997) A Watson–Crick finite automata, In: 3rd DIMACS Sympozium On DNA Based Computers, Philadelphia, pp. 305–317

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters;Electronic Proceedings in Theoretical Computer Science;2023-09-03

2. On language classes accepted by stateless 5′ → 3′ Watson-Crick finite automata;Annales Mathematicae et Informaticae;2023

3. Quasi-deterministic 5' -> 3' Watson-Crick Automata;Electronic Proceedings in Theoretical Computer Science;2022-08-27