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:

The complexity of concatenation on deterministic and alternating finite automata

Michal Hospodár, Galina Jirásková

RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 153-168

Published online: 2019-01-24

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

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

Operational complexity: NFA-to-DFA trade-off

Michal Hospodár, Jozef Jirásek, Galina Jirásková and Juraj Šebej
Information and Computation 307 105369 (2025)
https://doi.org/10.1016/j.ic.2025.105369

Operations on Boolean and Alternating Finite Automata

Galina Jirásková
Electronic Proceedings in Theoretical Computer Science 386 3 (2023)
https://doi.org/10.4204/EPTCS.386.1

Alternation in two-way finite automata

Christos Kapoutsis and Mohammad Zakzok
Theoretical Computer Science 870 75 (2021)
https://doi.org/10.1016/j.tcs.2020.12.011