Each regular code is included in a maximal regular code
RAIRO-Theor. Inf. Appl., 20 1 (1986) 89-96
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
Topologies for error-detecting variable-length codes
Jean NéraudInformation and Computation 295 105092 (2023)
https://doi.org/10.1016/j.ic.2023.105092
Algebraic Informatics
Jean NéraudLecture Notes in Computer Science, Algebraic Informatics 13706 203 (2022)
https://doi.org/10.1007/978-3-031-19685-0_15
Variable-length codes independent or closed with respect to edit relations
Jean NéraudInformation and Computation 288 104747 (2022)
https://doi.org/10.1016/j.ic.2021.104747
Coding by minimal linear grammars
Arturo Carpi and Flavio D'AlessandroTheoretical Computer Science 834 14 (2020)
https://doi.org/10.1016/j.tcs.2020.01.032
12038 437 (2020)
https://doi.org/10.1007/978-3-030-40608-0_31
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
Descriptional Complexity of Formal Systems
Stavros KonstantinidisLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 10316 45 (2017)
https://doi.org/10.1007/978-3-319-60252-3_4
Combinatorics on Words
Jean Néraud and Carla SelmiLecture Notes in Computer Science, Combinatorics on Words 10432 214 (2017)
https://doi.org/10.1007/978-3-319-66396-8_20
FULL MONOIDS AND MAXIMAL CODES
FABIO BURDERIInternational Journal of Foundations of Computer Science 23 (08) 1677 (2012)
https://doi.org/10.1142/S0129054112400692
Monoids and Maximal Codes
Fabio BurderiElectronic Proceedings in Theoretical Computer Science 63 83 (2011)
https://doi.org/10.4204/EPTCS.63.12
Embeddings of local automata
Marie-Pierre Béal, Sylvain Lombardy and Dominique PerrinIllinois Journal of Mathematics 54 (1) (2010)
https://doi.org/10.1215/ijm/1299679743
Completing codes in a sofic shift
Marie-Pierre Béal and Dominique PerrinTheoretical Computer Science 410 (43) 4423 (2009)
https://doi.org/10.1016/j.tcs.2009.07.023
2351 (2008)
https://doi.org/10.1109/ISIT.2008.4595411
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
STACS 2006
Marie-Pierre Béal and Dominique PerrinLecture Notes in Computer Science, STACS 2006 3884 127 (2006)
https://doi.org/10.1007/11672142_9
BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
LILA KARI, STAVROS KONSTANTINIDIS and PETR SOSÍKInternational Journal of Foundations of Computer Science 16 (05) 1039 (2005)
https://doi.org/10.1142/S0129054105003467
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
STACS 2005
Fabio Burderi and Antonio RestivoLecture Notes in Computer Science, STACS 2005 3404 545 (2005)
https://doi.org/10.1007/978-3-540-31856-9_45
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
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
On maximal synchronous codes
Yannick GuesnetTheoretical Computer Science 307 (1) 129 (2003)
https://doi.org/10.1016/S0304-3975(03)00097-5
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 maximal codes with a finite interpreting delay
Yannick GuesnetTheoretical Computer Science 273 (1-2) 167 (2002)
https://doi.org/10.1016/S0304-3975(00)00439-4
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
Generating Functions of Circular Codes
Frédérique BassinoAdvances in Applied Mathematics 22 (1) 1 (1999)
https://doi.org/10.1006/aama.1998.0613
On maximal codes with bounded synchronization delay
Véronique BruyèreTheoretical Computer Science 204 (1-2) 11 (1998)
https://doi.org/10.1016/S0304-3975(98)00028-0
Handbook of Formal Languages
Helmut Jürgensen and Stavros KonstantinidisHandbook of Formal Languages 511 (1997)
https://doi.org/10.1007/978-3-642-59136-5_8
Automata, Languages and Programming
Véronique BruyèreLecture Notes in Computer Science, Automata, Languages and Programming 1256 87 (1997)
https://doi.org/10.1007/3-540-63165-8_167
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 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
Valuations of languages, with applications to fractal geometry
Henning FernauTheoretical Computer Science 137 (2) 177 (1995)
https://doi.org/10.1016/0304-3975(94)00049-O
On codes having no finite completion
Nguyen Huong LamRAIRO - Theoretical Informatics and Applications 29 (2) 145 (1995)
https://doi.org/10.1051/ita/1995290201451
Note on the topological structure of random strings
Cristian Calude and Cezar CâmpeanuTheoretical Computer Science 112 (2) 383 (1993)
https://doi.org/10.1016/0304-3975(93)90027-Q
Surjective Extensions of Sliding-Block Codes
Jonathan Ashley, Brian Marcus, Dominique Perrin and Selim TuncelSIAM Journal on Discrete Mathematics 6 (4) 582 (1993)
https://doi.org/10.1137/0406046
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
Maximal codes with bounded deciphering delay
Vèronique BruyèreTheoretical Computer Science 84 (1) 53 (1991)
https://doi.org/10.1016/0304-3975(91)90260-9
On Completion of Codes with Finite Deciphering Delay
Véronique Bruyère, Limin Wang and Liang ZhangEuropean Journal of Combinatorics 11 (6) 513 (1990)
https://doi.org/10.1016/S0195-6698(13)80036-4
Automata, Languages and Programming
Véronique BruyereLecture Notes in Computer Science, Automata, Languages and Programming 372 151 (1989)
https://doi.org/10.1007/BFb0035758
A note on multiset decipherable codes
A. RestivoIEEE Transactions on Information Theory 35 (3) 662 (1989)
https://doi.org/10.1109/18.30991
Completing codes
A. Restivo, S. Salemi and T. SportelliRAIRO - Theoretical Informatics and Applications 23 (2) 135 (1989)
https://doi.org/10.1051/ita/1989230201351