Repetitive strings are not context-free
RAIRO. Inform. théor., 16 3 (1982) 191-199
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):
Computing and Combinatorics
Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han and Sang-Ki KoLecture Notes in Computer Science, Computing and Combinatorics 13025 189 (2021)
https://doi.org/10.1007/978-3-030-89543-3_16
Algorithmic Bioprocesses
Masami Ito, Lila Kari, Zachary Kincaid and Shinnosuke SekiNatural Computing Series, Algorithmic Bioprocesses 43 (2009)
https://doi.org/10.1007/978-3-540-88869-7_4
On the context-freeness of the set of words containing overlaps
Narad RampersadInformation Processing Letters 102 (2-3) 74 (2007)
https://doi.org/10.1016/j.ipl.2006.11.008
Developments in Language Theory
Peter LeupoldLecture Notes in Computer Science, Developments in Language Theory 4588 290 (2007)
https://doi.org/10.1007/978-3-540-73208-2_28
String Processing and Information Retrieval
Jin-Ju Hong and Gen-Huey ChenLecture Notes in Computer Science, String Processing and Information Retrieval 4209 74 (2006)
https://doi.org/10.1007/11880561_7
Uniformly bounded duplication languages
Peter Leupold, Carlos Martín-Vide and Victor MitranaDiscrete Applied Mathematics 146 (3) 301 (2005)
https://doi.org/10.1016/j.dam.2004.10.003
Sequences II
L. J. CummingsSequences II 439 (1993)
https://doi.org/10.1007/978-1-4613-9323-8_33
Formal Models and Semantics
J. BERSTEL and L. BOASSONFormal Models and Semantics 59 (1990)
https://doi.org/10.1016/B978-0-444-88074-1.50007-X
On the generation of powers by OS schemes
W. BucherDiscrete Applied Mathematics 23 (1) 33 (1989)
https://doi.org/10.1016/0166-218X(89)90033-4
The interchange or pump (DI)lemmas for context-free languages
R. Boonyavatana and G. SlutzkiTheoretical Computer Science 56 (3) 321 (1988)
https://doi.org/10.1016/0304-3975(88)90138-7
An “Interchange Lemma” for Context-Free Languages
William Ogden, Rockford J. Ross and Karl WinklmannSIAM Journal on Computing 14 (2) 410 (1985)
https://doi.org/10.1137/0214031
An infinite square-free co-CFL
Michael G. MainInformation Processing Letters 20 (2) 105 (1985)
https://doi.org/10.1016/0020-0190(85)90073-0
STACS 84
Jean BerstelLecture Notes in Computer Science, STACS 84 166 14 (1984)
https://doi.org/10.1007/3-540-12920-0_2