Article references

Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Linear automata with translucent letters and linear context-free trace languages

Benedek Nagy, Friedrich Otto

RAIRO-Theor. Inf. Appl., 54 (2020) 3

Published online: 2020-04-10

DOI: https://doi.org/10.1051/ita/2020002

This article has been cited by the following article(s):

State-deterministic $$5'\rightarrow 3'$$ Watson-Crick automata

Benedek Nagy
Natural Computing 20 (4) 725 (2021)
DOI: 10.1007/s11047-021-09865-z
See this article

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

Benedek Nagy and Shaghayegh Parchami
Natural Computing (2021)
DOI: 10.1007/s11047-021-09869-9
See this article

On deterministic sensing $$5'\rightarrow 3'$$ Watson–Crick finite automata: a full hierarchy in 2detLIN

Benedek Nagy and Shaghayegh Parchami
Acta Informatica 58 (3) 153 (2021)
DOI: 10.1007/s00236-019-00362-6
See this article

A jumping $$5'\rightarrow 3'$$ Watson–Crick finite automata model

Radim Kocman, Zbyněk Křivka, Alexander Meduna and Benedek Nagy
Acta Informatica (2022)
DOI: 10.1007/s00236-021-00413-x
See this article