The following publications are possibly variants of this publication:
- On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducersBenedek Nagy, Zita Kovács. ita, 55:5, 2021. [doi]
- On 5 --> 3 Sensing Watson-Crick Finite AutomataBenedek Nagy. dna 2008: 256-262 [doi]
- On a hierarchy of 5′ → 3′ sensing Watson-Crick finite automata languagesBenedek Nagy. logcom, 23(4):855-872, 2013. [doi]
- On deterministic sensing $5'\rightarrow 3'$ Watson-Crick finite automata: a full hierarchy in 2detLINBenedek Nagy, Shaghayegh Parchami. ACTA, 58(3):153-175, 2021. [doi]
- $5'\rightarrow 3'$ Watson-Crick automata languages-without sensing parameterBenedek Nagy, Shaghayegh Parchami. nc, 21(4):679-691, 2022. [doi]
- A jumping 5' → 3' Watson-Crick finite automata modelRadim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna. ncma 2018: 117-132
- A jumping $5'\rightarrow 3'$ Watson-Crick finite automata modelRadim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy. ACTA, 59(5):557-584, 2022. [doi]
- State-deterministic $5'\rightarrow 3'$ Watson-Crick automataBenedek Nagy. nc, 20(4):725-737, 2021. [doi]
- Deterministic Sensing 5'\rightarrow 3' 5 ′ → 3 ′ Watson-Crick Automata Without Sensing ParameterShaghayegh Parchami, Benedek Nagy. uc 2018: 173-187 [doi]
- 5' → 3' Watson-Crick Automata with Several RunsPeter Leupold, Benedek Nagy. ncma 2009: 167-180
- Stateless multicounter 5′ → 3′ Watson-Crick automataÖmer Egecioglu, László Hegedüs, Benedek Nagy. bic-ta 2010: 1599-1606 [doi]
- 5′→3′ Watson-Crick pushdown automataBenedek Nagy. isci, 537:452-466, 2020. [doi]
- 5 -> 3 Watson-Crick AutomataWith Several RunsPeter Leupold, Benedek Nagy. FUIN, 104(1-2):71-91, 2010. [doi]
- Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata LanguagesÖmer Egecioglu, László Hegedüs, Benedek Nagy. FUIN, 110(1-4):111-123, 2011. [doi]