The family of languages satisfying Bar-Hillel's lemma
RAIRO. Inform. théor., 12 3 (1978) 193-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):
Fundamentals of Computation Theory
P. Dömösi, S. Horváth, M. Ito, L. Kászonyi and M. KatsuraLecture Notes in Computer Science, Fundamentals of Computation Theory 710 194 (1993)
https://doi.org/10.1007/3-540-57163-9_15
On languages satisfying “interchange Lemma”
Victor MitranaRAIRO - Theoretical Informatics and Applications 27 (1) 71 (1993)
https://doi.org/10.1051/ita/1993270100711
Comparisons between some pumping conditions for context-free languages
R. Hewett and G. SlutzkiMathematical Systems Theory 21 (1) 223 (1988)
https://doi.org/10.1007/BF02088014
On satisfying the LL-iteration theorem
Anton NijholtTheoretical Computer Science 23 (1) 91 (1988)
https://doi.org/10.1016/0304-3975(88)90011-4
On context-free and Szilard languages
Erkki MäkinenBIT 24 (2) 164 (1984)
https://doi.org/10.1007/BF01937483
Classes of languages proof against regular pumping
R. SommerhalderRAIRO. Informatique théorique 14 (2) 169 (1980)
https://doi.org/10.1051/ita/1980140201691
Quelques problèmes ouverts en théorie des langages algébriques
J. M. Autebert, J. Beauquier, L. Boasson and M. NivatRAIRO. Informatique théorique 13 (4) 363 (1979)
https://doi.org/10.1051/ita/1979130403631