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

Codes, simplifying words, and open set condition

Ludwig Staiger
Information Processing Letters 58 (6) 297 (1996)
DOI: 10.1016/0020-0190(96)00074-9
See this article

On codes, ω-codes and ω-generators

S. Julia, I. Litovsky and B. Patrou
Information Processing Letters 60 (1) 1 (1996)
DOI: 10.1016/S0020-0190(96)00136-6
See this article

Prefix-free languages as ω-generators

Igor Litovsky
Information Processing Letters 37 (2) 61 (1991)
DOI: 10.1016/0020-0190(91)90134-4
See this article

HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES

TOMMI LEHTINEN and ALEXANDER OKHOTIN
International Journal of Foundations of Computer Science 24 (07) 1049 (2013)
DOI: 10.1142/S0129054113400303
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

Infinite Words - Automata, Semigroups, Logic and Games

Pure and Applied Mathematics, Infinite Words - Automata, Semigroups, Logic and Games 141 499 (2004)
DOI: 10.1016/S0079-8169(04)80014-X
See this article

Minimal generators of submonoids of $A^\infty $

I. Litovsky
RAIRO - Theoretical Informatics and Applications 25 (1) 3 (1991)
DOI: 10.1051/ita/1991250100031
See this article

PREFIX-FREE ŁUKASIEWICZ LANGUAGES

LUDWIG STAIGER
International Journal of Foundations of Computer Science 18 (06) 1417 (2007)
DOI: 10.1142/S0129054107005455
See this article

Sandrine Julia
1099 393 (1996)
DOI: 10.1007/3-540-61440-0_145
See this article

Tommi Lehtinen and Alexander Okhotin
7410 154 (2012)
DOI: 10.1007/978-3-642-31653-1_15
See this article

H. Jürgensen and S. Konstantinidis
1133 149 (1996)
DOI: 10.1007/BFb0025142
See this article

Dang Quyet Thang, Nguyen Dinh Han and Phan Trung Huy
7513 625 (2012)
DOI: 10.1007/978-3-642-35606-3_74
See this article

Sandrine Julia and Tran Vinh Duc
4588 266 (2007)
DOI: 10.1007/978-3-540-73208-2_26
See this article

H. Jürgensen and S. Konstantinidis
944 581 (1995)
DOI: 10.1007/3-540-60084-1_107
See this article

Henning Fernau and Ludwig Staiger
820 11 (1994)
DOI: 10.1007/3-540-58201-0_54
See this article

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

Nguyen Huong Lam and Do Long
520 308 (1991)
DOI: 10.1007/3-540-54345-7_74
See this article

Nguyen Dinh Han, Phan Trung Huy and Dang Quyet Thang
7196 338 (2012)
DOI: 10.1007/978-3-642-28487-8_35
See this article

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

On a class of infinitary codes

Nguyen Huong Lâm and Do Long Van
RAIRO - Theoretical Informatics and Applications 24 (5) 441 (1990)
DOI: 10.1051/ita/1990240504411
See this article

The entropy of Łukasiewicz-languages

Ludwig Staiger
RAIRO - Theoretical Informatics and Applications 39 (4) 621 (2005)
DOI: 10.1051/ita:2005032
See this article

Finitary codes for biinfinite words

J. Devolder and E. Timmerman
RAIRO - Theoretical Informatics and Applications 26 (4) 363 (1992)
DOI: 10.1051/ita/1992260403631
See this article

Rebootable and suffix-closed $\omega $-power languages

B. Le Saëc and I. Litovsky
RAIRO - Theoretical Informatics and Applications 26 (1) 45 (1992)
DOI: 10.1051/ita/1992260100451
See this article

Decidability of code properties

Henning Fernau, Klaus Reinhardt and Ludwig Staiger
RAIRO - Theoretical Informatics and Applications 41 (3) 243 (2007)
DOI: 10.1051/ita:2007019
See this article