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:

Minimal partial languages and automata

Francine Blanchet-Sadri, K. Goldner, A. Shackleton

RAIRO-Theor. Inf. Appl., 51 2 (2017) 99-119

Published online: 2017-11-17

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

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

State complexity of finite partial languages

Martin Kutrib and Matthias Wendlandt
Theoretical Computer Science 966-967 114001 (2023)
https://doi.org/10.1016/j.tcs.2023.114001

Combinatorial Image Analysis

Meenakshi Paramasivan, R. Krishna Kumari, R. Arulprakasam and V. Rajkumar Dare
Lecture Notes in Computer Science, Combinatorial Image Analysis 13348 226 (2023)
https://doi.org/10.1007/978-3-031-23612-9_14

Descriptional Complexity of Formal Systems

Martin Kutrib and Matthias Wendlandt
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 13439 170 (2022)
https://doi.org/10.1007/978-3-031-13257-5_13

Two Extensions of Cover Automata

Cezar Câmpeanu
Axioms 10 (4) 338 (2021)
https://doi.org/10.3390/axioms10040338

Martin Kutrib and Matthias Wendlandt
13037 113 (2021)
https://doi.org/10.1007/978-3-030-93489-7_10