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:

On infinitary finite length codes

Ludwig Staiger

RAIRO-Theor. Inf. Appl., 20 4 (1986) 483-494

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1986200404831

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

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

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

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

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