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:

Les automates circulaires biaisés vérifient la conjecture de Černý

L. Dubuc

RAIRO-Theor. Inf. Appl., 30 6 (1996) 495-505

Published online: 2017-02-01

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

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

Binary and circular automata having maximal state complexity for the set of synchronizing words

Stefan Hoffmann
Information and Computation 295 105076 (2023)
https://doi.org/10.1016/j.ic.2023.105076

Stefan Hoffmann
13037 38 (2021)
https://doi.org/10.1007/978-3-030-93489-7_4

WORDS GUARANTEEING MINIMUM IMAGE

S. W. MARGOLIS, J.-E. PIN and M. V. VOLKOV
International Journal of Foundations of Computer Science 15 (02) 259 (2004)
https://doi.org/10.1142/S0129054104002406

Developments in Language Theory

D. S. Ananichev and M. V. Volkov
Lecture Notes in Computer Science, Developments in Language Theory 2295 166 (2002)
https://doi.org/10.1007/3-540-46011-X_13

Sur les automates circulaires et la conjecture de Černý

L. Dubuc
RAIRO - Theoretical Informatics and Applications 32 (1-3) 21 (1998)
https://doi.org/10.1051/ita/1998321-300211