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):

Completing circular codes in regular submonoids

Jean Néraud
Theoretical Computer Science 391 (1-2) 90 (2008)
DOI: 10.1016/j.tcs.2007.10.033
See this article

Descriptional Complexity of Formal Systems

Stavros Konstantinidis
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 10316 45 (2017)
DOI: 10.1007/978-3-319-60252-3_4
See this article

Valuations of languages, with applications to fractal geometry

Henning Fernau
Theoretical Computer Science 137 (2) 177 (1995)
DOI: 10.1016/0304-3975(94)00049-O
See this article

On maximal codes with a finite interpreting delay

Yannick Guesnet
Theoretical Computer Science 273 (1-2) 167 (2002)
DOI: 10.1016/S0304-3975(00)00439-4
See this article

FULL MONOIDS AND MAXIMAL CODES

FABIO BURDERI
International Journal of Foundations of Computer Science 23 (08) 1677 (2012)
DOI: 10.1142/S0129054112400692
See this article

Locally complete sets and finite decomposable codes

Jean Néraud and Carla Selmi
Theoretical Computer Science 273 (1-2) 185 (2002)
DOI: 10.1016/S0304-3975(00)00440-0
See this article

Surjective Extensions of Sliding-Block Codes

Jonathan Ashley, Brian Marcus, Dominique Perrin and Selim Tuncel
SIAM Journal on Discrete Mathematics 6 (4) 582 (1993)
DOI: 10.1137/0406046
See this article

Maximal codes with bounded deciphering delay

Vèronique Bruyère
Theoretical Computer Science 84 (1) 53 (1991)
DOI: 10.1016/0304-3975(91)90260-9
See this article

Completing codes in a sofic shift

Marie-Pierre Béal and Dominique Perrin
Theoretical Computer Science 410 (43) 4423 (2009)
DOI: 10.1016/j.tcs.2009.07.023
See this article

Generating Functions of Circular Codes

Frédérique Bassino
Advances in Applied Mathematics 22 (1) 1 (1999)
DOI: 10.1006/aama.1998.0613
See this article

On codes with a finite deciphering delay: constructing uncompletable words

Jean Néraud and Carla Selmi
Theoretical Computer Science 255 (1-2) 151 (2001)
DOI: 10.1016/S0304-3975(99)00160-7
See this article

On maximal synchronous codes

Yannick Guesnet
Theoretical Computer Science 307 (1) 129 (2003)
DOI: 10.1016/S0304-3975(03)00097-5
See this article

Note on the topological structure of random strings

Cristian Calude and Cezar Câmpeanu
Theoretical Computer Science 112 (2) 383 (1993)
DOI: 10.1016/0304-3975(93)90027-Q
See this article

An application of Hajós factorizations to variable-length codes

Clelia De Felice
Theoretical Computer Science 164 (1-2) 223 (1996)
DOI: 10.1016/0304-3975(95)00223-5
See this article

FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS

JEAN NÉRAUD and CARLA SELMI
International Journal of Algebra and Computation 13 (05) 507 (2003)
DOI: 10.1142/S0218196703001584
See this article

On maximal codes with bounded synchronization delay

Véronique Bruyère
Theoretical Computer Science 204 (1-2) 11 (1998)
DOI: 10.1016/S0304-3975(98)00028-0
See this article

On codes having no finite completion

Nguyen Huong Lam
RAIRO - Theoretical Informatics and Applications 29 (2) 145 (1995)
DOI: 10.1051/ita/1995290201451
See this article

A note on multiset decipherable codes

A. Restivo
IEEE Transactions on Information Theory 35 (3) 662 (1989)
DOI: 10.1109/18.30991
See this article

Marie-Pierre Béal and Dominique Perrin
3884 127 (2006)
DOI: 10.1007/11672142_9
See this article

Fabio Burderi and Antonio Restivo
3404 545 (2005)
DOI: 10.1007/978-3-540-31856-9_45
See this article

H. Jürgensen and S. Konstantinidis
710 50 (1993)
DOI: 10.1007/3-540-57163-9_4
See this article

Jean Néraud and Carla Selmi
10432 214 (2017)
DOI: 10.1007/978-3-319-66396-8_20
See this article

Véronique Bruyère and Michel Latteux
1099 24 (1996)
DOI: 10.1007/3-540-61440-0_115
See this article

Do Long Van, Kieu Van Hung and Phan Trung Huy
3722 29 (2005)
DOI: 10.1007/11560647_2
See this article

Jean Néraud
3354 281 (2005)
DOI: 10.1007/978-3-540-31834-7_23
See this article

Monoids and Maximal Codes

Fabio Burderi
Electronic Proceedings in Theoretical Computer Science 63 83 (2011)
DOI: 10.4204/EPTCS.63.12
See this article

On Completion of Codes with Finite Deciphering Delay

Véronique Bruyère, Limin Wang and Liang Zhang
European Journal of Combinatorics 11 (6) 513 (1990)
DOI: 10.1016/S0195-6698(13)80036-4
See this article

Marie-Pierre Beal, Sylvain Lombardy and Dominique Perrin
2351 (2008)
DOI: 10.1109/ISIT.2008.4595411
See this article

Jean Néraud
12038 437 (2020)
DOI: 10.1007/978-3-030-40608-0_31
See this article

Helmut Jürgensen and Stavros Konstantinidis
511 (1997)
DOI: 10.1007/978-3-642-59136-5_8
See this article

Véronique Bruyère
1256 87 (1997)
DOI: 10.1007/3-540-63165-8_167
See this article

Coding by minimal linear grammars

Arturo Carpi and Flavio D'Alessandro
Theoretical Computer Science 834 14 (2020)
DOI: 10.1016/j.tcs.2020.01.032
See this article

Embeddings of local automata

Marie-Pierre Béal, Sylvain Lombardy and Dominique Perrin
Illinois Journal of Mathematics 54 (1) (2010)
DOI: 10.1215/ijm/1299679743
See this article

BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS

LILA KARI, STAVROS KONSTANTINIDIS and PETR SOSÍK
International Journal of Foundations of Computer Science 16 (05) 1039 (2005)
DOI: 10.1142/S0129054105003467
See this article

Completing codes

A. Restivo, S. Salemi and T. Sportelli
RAIRO - Theoretical Informatics and Applications 23 (2) 135 (1989)
DOI: 10.1051/ita/1989230201351
See this article

On codes having no finite completion

Nguyen Huong Lam
RAIRO - Theoretical Informatics and Applications 30 (6) 483 (1996)
DOI: 10.1051/ita/1996300604831
See this article