Codes et motifs
RAIRO-Theor. Inf. Appl., 23 4 (1989) 425-444
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):
Conjugacy relations of prefix codes
Yong He, Zhenhe Cui and Zihan YuanTheoretical Computer Science 635 85 (2016)
https://doi.org/10.1016/j.tcs.2016.05.021
On effective construction of the greatest solution of language inequalityXA⊆BX
Olivier Ly and Zhilin WuTheoretical Computer Science 528 12 (2014)
https://doi.org/10.1016/j.tcs.2014.02.001
Simple equations on binary factorial languages
A.E. FridTheoretical Computer Science 410 (30-32) 2947 (2009)
https://doi.org/10.1016/j.tcs.2009.03.001
Conjugacy of finite biprefix codes
Julien Cassaigne, Juhani Karhumäki and Petri SalmelaTheoretical Computer Science 410 (24-25) 2345 (2009)
https://doi.org/10.1016/j.tcs.2009.02.030
Playing with Conway’s problem
Emmanuel Jeandel and Nicolas OllingerTheoretical Computer Science 409 (3) 557 (2008)
https://doi.org/10.1016/j.tcs.2008.09.026
Developments in Language Theory
Michal KuncLecture Notes in Computer Science, Developments in Language Theory 4588 23 (2007)
https://doi.org/10.1007/978-3-540-73208-2_3
Developments in Language Theory
Anna E. FridLecture Notes in Computer Science, Developments in Language Theory 4588 193 (2007)
https://doi.org/10.1007/978-3-540-73208-2_20
On the simplest centralizer of a language
Paolo Massazza and Petri SalmelaRAIRO - Theoretical Informatics and Applications 40 (2) 295 (2006)
https://doi.org/10.1051/ita:2006014
STACS 2005
Michal KuncLecture Notes in Computer Science, STACS 2005 3404 569 (2005)
https://doi.org/10.1007/978-3-540-31856-9_47
A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
S. V. AVGUSTINOVICH and A. E. FRIDInternational Journal of Algebra and Computation 15 (01) 149 (2005)
https://doi.org/10.1142/S0218196705002116
On the complexity of decidable cases of the commutation problem of languages
Juhani Karhumäki, Wojciech Plandowski and Wojciech RytterTheoretical Computer Science 337 (1-3) 105 (2005)
https://doi.org/10.1016/j.tcs.2004.03.073
Developments in Language Theory
Michal KuncLecture Notes in Computer Science, Developments in Language Theory 3572 327 (2005)
https://doi.org/10.1007/11505877_29
Machines, Computations, and Universality
Juhani KarhumäkiLecture Notes in Computer Science, Machines, Computations, and Universality 3354 36 (2005)
https://doi.org/10.1007/978-3-540-31834-7_3
Commutation with codes
Juhani Karhumäki, Michel Latteux and Ion PetreTheoretical Computer Science 340 (2) 322 (2005)
https://doi.org/10.1016/j.tcs.2005.03.037
Aspects of Molecular Computing
Karel Culik, Juhani Karhumäki and Petri SalmelaLecture Notes in Computer Science, Aspects of Molecular Computing 2950 119 (2003)
https://doi.org/10.1007/978-3-540-24635-0_8
A non-ambiguous decomposition of regular languages and factorizing codes
Marcella AnselmoDiscrete Applied Mathematics 126 (2-3) 129 (2003)
https://doi.org/10.1016/S0166-218X(02)00193-2
STACS 2003
Juhani Karhumäki, Michel Latteux and Ion PetreLecture Notes in Computer Science, STACS 2003 2607 74 (2003)
https://doi.org/10.1007/3-540-36494-3_8
Conway's problem for three-word sets
Juhani Karhumäki and Ion PetreTheoretical Computer Science 289 (1) 705 (2002)
https://doi.org/10.1016/S0304-3975(01)00389-9
The commutation of finite sets: a challenging problem
Christian Choffrut, Juhani Karhumäki and Nicolas OllingerTheoretical Computer Science 273 (1-2) 69 (2002)
https://doi.org/10.1016/S0304-3975(00)00434-5
Formal and Natural Computing
Juhani Karhumäki and Ion PetreLecture Notes in Computer Science, Formal and Natural Computing 2300 69 (2002)
https://doi.org/10.1007/3-540-45711-9_5
Fundamentals of Computation Theory
Juhani Karhumäki, Wojciech Plandowski and Wojciech RytterLecture Notes in Computer Science, Fundamentals of Computation Theory 2138 193 (2001)
https://doi.org/10.1007/3-540-44669-9_20
Fundamentals of Computation Theory
Juhani KarhumäkiLecture Notes in Computer Science, Fundamentals of Computation Theory 2138 15 (2001)
https://doi.org/10.1007/3-540-44669-9_3
Machines, Computations, and Universality
Juhani KarhumäkiLecture Notes in Computer Science, Machines, Computations, and Universality 2055 69 (2001)
https://doi.org/10.1007/3-540-45132-3_4
ON THE ROOT OF LANGUAGES
P. MASSAZZAInternational Journal of Algebra and Computation 11 (05) 549 (2001)
https://doi.org/10.1142/S0218196701000711
On Conjugacy of Languages
Julien Cassaigne, Juhani Karhumäki and Ján MaňuchRAIRO - Theoretical Informatics and Applications 35 (6) 535 (2001)
https://doi.org/10.1051/ita:2001130
Formal Power Series and Algebraic Combinatorics
A. Bertoni and P. MassazzaFormal Power Series and Algebraic Combinatorics 125 (2000)
https://doi.org/10.1007/978-3-662-04166-6_11
Automata, Languages and Programming
Juhani Karhumäki and Ion PetreLecture Notes in Computer Science, Automata, Languages and Programming 1853 536 (2000)
https://doi.org/10.1007/3-540-45022-X_45
Equations over finite sets of words and equivalence problems in automata theory
J. KarhumäkiTheoretical Computer Science 108 (1) 103 (1993)
https://doi.org/10.1016/0304-3975(93)90232-I
Motifs et bases de langages
Jean-Michel Autebert, Luc Boasson and Michel LatteuxRAIRO - Theoretical Informatics and Applications 23 (4) 379 (1989)
https://doi.org/10.1051/ita/1989230403791