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:

Codes et motifs

Bodonirina Ratoandromanana

RAIRO-Theor. Inf. Appl., 23 4 (1989) 425-444

Published online: 2017-02-01

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

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

Conway's problem for three-word sets

Juhani Karhumäki and Ion Petre
Theoretical Computer Science 289 (1) 705 (2002)
DOI: 10.1016/S0304-3975(01)00389-9
See this article

Conjugacy of finite biprefix codes

Julien Cassaigne, Juhani Karhumäki and Petri Salmela
Theoretical Computer Science 410 (24-25) 2345 (2009)
DOI: 10.1016/j.tcs.2009.02.030
See this article

Equations over finite sets of words and equivalence problems in automata theory

J. Karhumäki
Theoretical Computer Science 108 (1) 103 (1993)
DOI: 10.1016/0304-3975(93)90232-I
See this article

On the complexity of decidable cases of the commutation problem of languages

Juhani Karhumäki, Wojciech Plandowski and Wojciech Rytter
Theoretical Computer Science 337 (1-3) 105 (2005)
DOI: 10.1016/j.tcs.2004.03.073
See this article

ON THE ROOT OF LANGUAGES

P. MASSAZZA
International Journal of Algebra and Computation 11 (05) 549 (2001)
DOI: 10.1142/S0218196701000711
See this article

A non-ambiguous decomposition of regular languages and factorizing codes

Marcella Anselmo
Discrete Applied Mathematics 126 (2-3) 129 (2003)
DOI: 10.1016/S0166-218X(02)00193-2
See this article

The commutation of finite sets: a challenging problem

Christian Choffrut, Juhani Karhumäki and Nicolas Ollinger
Theoretical Computer Science 273 (1-2) 69 (2002)
DOI: 10.1016/S0304-3975(00)00434-5
See this article

Playing with Conway’s problem

Emmanuel Jeandel and Nicolas Ollinger
Theoretical Computer Science 409 (3) 557 (2008)
DOI: 10.1016/j.tcs.2008.09.026
See this article

Simple equations on binary factorial languages

A.E. Frid
Theoretical Computer Science 410 (30-32) 2947 (2009)
DOI: 10.1016/j.tcs.2009.03.001
See this article

Commutation with codes

Juhani Karhumäki, Michel Latteux and Ion Petre
Theoretical Computer Science 340 (2) 322 (2005)
DOI: 10.1016/j.tcs.2005.03.037
See this article

Conjugacy relations of prefix codes

Yong He, Zhenhe Cui and Zihan Yuan
Theoretical Computer Science 635 85 (2016)
DOI: 10.1016/j.tcs.2016.05.021
See this article