On infinitary finite length codes
RAIRO-Theor. Inf. Appl., 20 4 (1986) 483-494
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):
One-relation languages and code generators
Vinh Duc Tran and Igor LitovskyRAIRO - Theoretical Informatics and Applications 55 2 (2021)
https://doi.org/10.1051/ita/2021002
The Maximal Complexity of Quasiperiodic Infinite Words
Ludwig StaigerAxioms 10 (4) 306 (2021)
https://doi.org/10.3390/axioms10040306
HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES
TOMMI LEHTINEN and ALEXANDER OKHOTINInternational Journal of Foundations of Computer Science 24 (07) 1049 (2013)
https://doi.org/10.1142/S0129054113400303
Developments in Language Theory
Tommi Lehtinen and Alexander OkhotinLecture Notes in Computer Science, Developments in Language Theory 7410 154 (2012)
https://doi.org/10.1007/978-3-642-31653-1_15
Network and Parallel Computing
Dang Quyet Thang, Nguyen Dinh Han and Phan Trung HuyLecture Notes in Computer Science, Network and Parallel Computing 7513 625 (2012)
https://doi.org/10.1007/978-3-642-35606-3_74
Intelligent Information and Database Systems
Nguyen Dinh Han, Phan Trung Huy and Dang Quyet ThangLecture Notes in Computer Science, Intelligent Information and Database Systems 7196 338 (2012)
https://doi.org/10.1007/978-3-642-28487-8_35
Decidability of code properties
Henning Fernau, Klaus Reinhardt and Ludwig StaigerRAIRO - Theoretical Informatics and Applications 41 (3) 243 (2007)
https://doi.org/10.1051/ita:2007019
PREFIX-FREE ŁUKASIEWICZ LANGUAGES
LUDWIG STAIGERInternational Journal of Foundations of Computer Science 18 (06) 1417 (2007)
https://doi.org/10.1142/S0129054107005455
Developments in Language Theory
Sandrine Julia and Tran Vinh DucLecture Notes in Computer Science, Developments in Language Theory 4588 266 (2007)
https://doi.org/10.1007/978-3-540-73208-2_26
The entropy of Łukasiewicz-languages
Ludwig StaigerRAIRO - Theoretical Informatics and Applications 39 (4) 621 (2005)
https://doi.org/10.1051/ita:2005032
Infinite Words - Automata, Semigroups, Logic and Games
Pure and Applied Mathematics, Infinite Words - Automata, Semigroups, Logic and Games 141 499 (2004)https://doi.org/10.1016/S0079-8169(04)80014-X
Developments in Language Theory
Ludwig StaigerLecture Notes in Computer Science, Developments in Language Theory 2295 155 (2002)
https://doi.org/10.1007/3-540-46011-X_12
511 (1997)
https://doi.org/10.1007/978-3-642-59136-5_8
339 (1997)
https://doi.org/10.1007/978-3-642-59126-6_6
New Trends in Formal Languages
Ludwig StaigerLecture Notes in Computer Science, New Trends in Formal Languages 1218 377 (1997)
https://doi.org/10.1007/3-540-62844-4_27
On codes, ω-codes and ω-generators
S. Julia, I. Litovsky and B. PatrouInformation Processing Letters 60 (1) 1 (1996)
https://doi.org/10.1016/S0020-0190(96)00136-6
Automata, Languages and Programming
Sandrine JuliaLecture Notes in Computer Science, Automata, Languages and Programming 1099 393 (1996)
https://doi.org/10.1007/3-540-61440-0_145
Codes, simplifying words, and open set condition
Ludwig StaigerInformation Processing Letters 58 (6) 297 (1996)
https://doi.org/10.1016/0020-0190(96)00074-9
Information Theory and Applications II
H. Jürgensen and S. KonstantinidisLecture Notes in Computer Science, Information Theory and Applications II 1133 149 (1996)
https://doi.org/10.1007/BFb0025142
Automata, Languages and Programming
H. Jürgensen and S. KonstantinidisLecture Notes in Computer Science, Automata, Languages and Programming 944 581 (1995)
https://doi.org/10.1007/3-540-60084-1_107
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
Automata, Languages and Programming
Henning Fernau and Ludwig StaigerLecture Notes in Computer Science, Automata, Languages and Programming 820 11 (1994)
https://doi.org/10.1007/3-540-58201-0_54
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
Finitary codes for biinfinite words
J. Devolder and E. TimmermanRAIRO - Theoretical Informatics and Applications 26 (4) 363 (1992)
https://doi.org/10.1051/ita/1992260403631
LATIN '92
Véronique BruyèreLecture Notes in Computer Science, LATIN '92 583 99 (1992)
https://doi.org/10.1007/BFb0023821
Rebootable and suffix-closed $\omega $-power languages
B. Le Saëc and I. LitovskyRAIRO - Theoretical Informatics and Applications 26 (1) 45 (1992)
https://doi.org/10.1051/ita/1992260100451
Mathematical Foundations of Computer Science 1991
Nguyen Huong Lam and Do LongLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1991 520 308 (1991)
https://doi.org/10.1007/3-540-54345-7_74
Prefix-free languages as ω-generators
Igor LitovskyInformation Processing Letters 37 (2) 61 (1991)
https://doi.org/10.1016/0020-0190(91)90134-4
Minimal generators of submonoids of $A^\infty $
I. LitovskyRAIRO - Theoretical Informatics and Applications 25 (1) 3 (1991)
https://doi.org/10.1051/ita/1991250100031
On a class of infinitary codes
Nguyen Huong Lâm and Do Long VanRAIRO - Theoretical Informatics and Applications 24 (5) 441 (1990)
https://doi.org/10.1051/ita/1990240504411