On the separating power of EOL systems
RAIRO. Inform. théor., 17 1 (1983) 13-22
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
Implementation and Application of Automata
Marius Dumitran, Javier Gil, Florin Manea and Victor MitranaLecture Notes in Computer Science, Implementation and Application of Automata 8587 176 (2014)
https://doi.org/10.1007/978-3-319-08846-4_13
Prefix–suffix duplication
Jesús García López, Florin Manea and Victor MitranaJournal of Computer and System Sciences 80 (7) 1254 (2014)
https://doi.org/10.1016/j.jcss.2014.02.011
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
Combinatorial Pattern Matching
Aviezri S. Fraenkel, Jamie Simpson and Mike PatersonLecture Notes in Computer Science, Combinatorial Pattern Matching 1264 76 (1997)
https://doi.org/10.1007/3-540-63220-4_51
Open Problems in Pattern Avoidance
James CurrieThe American Mathematical Monthly 100 (8) 790 (1993)
https://doi.org/10.1080/00029890.1993.11990489
Theoretical Studies in Computer Science
Michael A. HarrisonTheoretical Studies in Computer Science 15 (1992)
https://doi.org/10.1016/B978-0-12-708240-0.50007-1
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
Nonuniform complexity classes specified by lower and upper bounds
José L. Balcázar and Joaquim GabarróRAIRO - Theoretical Informatics and Applications 23 (2) 177 (1989)
https://doi.org/10.1051/ita/1989230201771
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
STACS 84
Jean BerstelLecture Notes in Computer Science, STACS 84 166 14 (1984)
https://doi.org/10.1007/3-540-12920-0_2
An optimal algorithm for computing the repetitions in a word
Max CrochemoreInformation Processing Letters 12 (5) 244 (1981)
https://doi.org/10.1016/0020-0190(81)90024-7