Completing codes
RAIRO-Theor. Inf. Appl., 23 2 (1989) 135-147
Published online: 2017-02-01
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):
Three-word codes $$\{a,\ aba,\ u\}$$ and $$\{a,\ ab,\ v\}$$ having finite completions
Chunhua Cao, Lei Liao, Zhongmei Yan, Di Yang and Yuguang YuanActa Informatica 62 (2) (2025)
https://doi.org/10.1007/s00236-025-00487-x
27 (2024)
https://doi.org/10.1007/978-981-99-9171-6_2
The second step in characterizing a three-word code
Chunhua Cao, Jiao Xu, Lei Liao, Di Yang, Guichuan Jia and Qian DuActa Informatica 60 (4) 453 (2023)
https://doi.org/10.1007/s00236-023-00444-6
Embedding a θ-invariant code into a complete one
Jean Néraud and Carla SelmiTheoretical Computer Science 806 28 (2020)
https://doi.org/10.1016/j.tcs.2018.08.022
On the proportion of prefix codes in the set of three-element codes
Adam WorynaDiscrete Mathematics 343 (8) 111939 (2020)
https://doi.org/10.1016/j.disc.2020.111939
Language and Automata Theory and Applications
Christophe CorderoLecture Notes in Computer Science, Language and Automata Theory and Applications 11417 409 (2019)
https://doi.org/10.1007/978-3-030-13435-8_30
On the length of uncompletable words in unambiguous automata
Antonio Boccuto and Arturo CarpiRAIRO - Theoretical Informatics and Applications 53 (3-4) 115 (2019)
https://doi.org/10.1051/ita/2019002
A first step in characterizing three-element codes
Cao Chunhua, Lu Qing and Yang DiActa Informatica 55 (5) 445 (2018)
https://doi.org/10.1007/s00236-017-0309-2
A note on the factorization conjecture
Clelia De FeliceActa Informatica 50 (7-8) 381 (2013)
https://doi.org/10.1007/s00236-013-0187-1
A characteristic property of elementary 2-groups of rank six
Sándor SzabóStudia Scientiarum Mathematicarum Hungarica 48 (3) 354 (2011)
https://doi.org/10.1556/sscmath.48.2011.3.1177
Completing circular codes in regular submonoids
Jean NéraudTheoretical Computer Science 391 (1-2) 90 (2008)
https://doi.org/10.1016/j.tcs.2007.10.033
FINITE COMPLETIONS VIA FACTORIZING CODES
CLELIA DE FELICEInternational Journal of Algebra and Computation 17 (04) 715 (2007)
https://doi.org/10.1142/S0218196707003871
A QUESTION CONCERNING THE FACTORIZATION OF CYCLIC GROUPS
A. D. SANDSInternational Journal of Algebra and Computation 17 (08) 1573 (2007)
https://doi.org/10.1142/S0218196707004293
On factorizing codes: Structural properties and related decision problems
Clelia De FeliceAdvances in Applied Mathematics 39 (2) 173 (2007)
https://doi.org/10.1016/j.aam.2005.12.002
On a complete set of operations for factorizing codes
Clelia De FeliceRAIRO - Theoretical Informatics and Applications 40 (1) 29 (2006)
https://doi.org/10.1051/ita:2005040
Completing codes and the Rédei property of groups
Sándor SzabóTheoretical Computer Science 359 (1-3) 449 (2006)
https://doi.org/10.1016/j.tcs.2006.02.002
Machines, Computations, and Universality
Jean NéraudLecture Notes in Computer Science, Machines, Computations, and Universality 3354 281 (2005)
https://doi.org/10.1007/978-3-540-31834-7_23
Theoretical Aspects of Computing – ICTAC 2005
Do Long Van, Kieu Van Hung and Phan Trung HuyLecture Notes in Computer Science, Theoretical Aspects of Computing – ICTAC 2005 3722 29 (2005)
https://doi.org/10.1007/11560647_2
An enhanced property of factorizing codes
Clelia De FeliceTheoretical Computer Science 340 (2) 240 (2005)
https://doi.org/10.1016/j.tcs.2005.03.022
On maximal synchronous codes
Yannick GuesnetTheoretical Computer Science 307 (1) 129 (2003)
https://doi.org/10.1016/S0304-3975(03)00097-5
FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
JEAN NÉRAUD and CARLA SELMIInternational Journal of Algebra and Computation 13 (05) 507 (2003)
https://doi.org/10.1142/S0218196703001584
Locally complete sets and finite decomposable codes
Jean Néraud and Carla SelmiTheoretical Computer Science 273 (1-2) 185 (2002)
https://doi.org/10.1016/S0304-3975(00)00440-0
On codes with a finite deciphering delay: constructing uncompletable words
Jean Néraud and Carla SelmiTheoretical Computer Science 255 (1-2) 151 (2001)
https://doi.org/10.1016/S0304-3975(99)00160-7
ON A PROPERTY OF THE FACTORIZING CODES
CLELIA DE FELICEInternational Journal of Algebra and Computation 09 (03n04) 325 (1999)
https://doi.org/10.1142/S0218196799000217
511 (1997)
https://doi.org/10.1007/978-3-642-59136-5_8
Hajós factorizations and completion of codes
Nguyen Huong LamTheoretical Computer Science 182 (1-2) 245 (1997)
https://doi.org/10.1016/S0304-3975(97)00032-7
A three-word code which is not prefix-suffix composed
Denis DerencourtTheoretical Computer Science 163 (1-2) 145 (1996)
https://doi.org/10.1016/0304-3975(95)00139-5
On codes having no finite completion
Nguyen Huong LamRAIRO - Theoretical Informatics and Applications 30 (6) 483 (1996)
https://doi.org/10.1051/ita/1996300604831
Automata, Languages and Programming
Véronique Bruyère and Michel LatteuxLecture Notes in Computer Science, Automata, Languages and Programming 1099 24 (1996)
https://doi.org/10.1007/3-540-61440-0_115
An application of Hajós factorizations to variable-length codes
Clelia De FeliceTheoretical Computer Science 164 (1-2) 223 (1996)
https://doi.org/10.1016/0304-3975(95)00223-5
On codes having no finite completion
Nguyen Huong LamRAIRO - Theoretical Informatics and Applications 29 (2) 145 (1995)
https://doi.org/10.1051/ita/1995290201451
A note on codes having no finite completions
Nguyen Huong LamInformation Processing Letters 55 (4) 185 (1995)
https://doi.org/10.1016/0020-0190(95)00102-I
Fundamentals of Computation Theory
H. Jürgensen and S. KonstantinidisLecture Notes in Computer Science, Fundamentals of Computation Theory 710 50 (1993)
https://doi.org/10.1007/3-540-57163-9_4