Mots sans répétitions et langages rationnels bornés
RAIRO. Inform. théor., 11 3 (1977) 197-202
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):
Unavoidable regularities in long words with bounded number of symbol occurrences
Juha Kortelainen, Tuomas Kortelainen and Ari VesanenJournal of Combinatorial Optimization 26 (4) 670 (2013)
https://doi.org/10.1007/s10878-012-9450-6
Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions
Juha KortelainenElectronic Proceedings in Theoretical Computer Science 63 22 (2011)
https://doi.org/10.4204/EPTCS.63.4
Computing and Combinatorics
Juha Kortelainen, Tuomas Kortelainen and Ari VesanenLecture Notes in Computer Science, Computing and Combinatorics 6842 519 (2011)
https://doi.org/10.1007/978-3-642-22685-4_45
Star-free sets of integers
Aldo de Luca and Antonio RestivoTheoretical Computer Science 43 265 (1986)
https://doi.org/10.1016/0304-3975(86)90180-5
Rational languages and the Burnside problem
Antonio Restivo and Christophe ReutenaeurTheoretical Computer Science 40 13 (1985)
https://doi.org/10.1016/0304-3975(85)90156-2
On cancellation properties of languages which are supports of rational power series
Antonio Restivo and Christophe ReutenauerJournal of Computer and System Sciences 29 (2) 153 (1984)
https://doi.org/10.1016/0022-0000(84)90026-6
Some applications of a theorem of Shirshov to language theory
Antonio Restivo and Christophe ReutenauerInformation and Control 57 (2-3) 205 (1983)
https://doi.org/10.1016/S0019-9958(83)80044-8
Rational bijection of rational sets
H. A. Maurer and M. NivatActa Informatica 13 (4) 365 (1980)
https://doi.org/10.1007/BF00288770