Non-returning deterministic and nondeterministic finite automata with translucent letters
RAIRO-Theor. Inf. Appl., 57 (2023) 8
Published online: 2023-10-18
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:
This article has been cited by the following article(s):
Deterministic pushdown automata with translucent input letters
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci and Matthias WendlandtInformation and Computation 308 105403 (2026)
https://doi.org/10.1016/j.ic.2026.105403
Input-Driven Pushdown Automata with Translucent Input Letters
Martin Kutrib, Andreas Malcher and Matthias WendlandtElectronic Proceedings in Theoretical Computer Science 422 29 (2025)
https://doi.org/10.4204/EPTCS.422.3
On Repetitive Finite Automata with Translucent Words
František Mráz and Friedrich OttoElectronic Proceedings in Theoretical Computer Science 422 59 (2025)
https://doi.org/10.4204/EPTCS.422.5
15759 151 (2025)
https://doi.org/10.1007/978-3-031-97100-6_11
15015 208 (2024)
https://doi.org/10.1007/978-3-031-71112-1_15
Repetitive Finite Automata With Translucent Letters
František Mráz and Friedrich OttoElectronic Proceedings in Theoretical Computer Science 407 150 (2024)
https://doi.org/10.4204/EPTCS.407.11
14791 203 (2024)
https://doi.org/10.1007/978-3-031-66159-4_15