Quelques problèmes ouverts en théorie des langages algébriques
RAIRO. Inform. théor., 13 4 (1979) 363-378
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):
Developments in Language Theory
Vladislav MakarovLecture Notes in Computer Science, Developments in Language Theory 12811 279 (2021)
https://doi.org/10.1007/978-3-030-81508-0_23
On regular realizability problems for context-free languages
M. N. Vyalyi and A. A. RubtsovProblems of Information Transmission 51 (4) 349 (2015)
https://doi.org/10.1134/S0032946015040043
Developments in Language Theory
Juha Kortelainen and Tuukka SalmiLecture Notes in Computer Science, Developments in Language Theory 6795 312 (2011)
https://doi.org/10.1007/978-3-642-22321-1_27
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
Fundamentals of Computation Theory
Patrice SééboldLecture Notes in Computer Science, Fundamentals of Computation Theory 380 384 (1989)
https://doi.org/10.1007/3-540-51498-8_37
Iterated GSMs and Co-CFL
Jean -Michel Autebert and Joaquim Gabarr�Acta Informatica 26 (8) 749 (1989)
https://doi.org/10.1007/BF00289160
STACS 89
J. BerstelLecture Notes in Computer Science, STACS 89 349 36 (1989)
https://doi.org/10.1007/BFb0028971
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
On the intersection of stacks and queues
Franz J. BrandenburgTheoretical Computer Science 58 (1-3) 69 (1988)
https://doi.org/10.1016/0304-3975(88)90019-9
Analytic models and ambiguity of context-free languages
Philippe FlajoletTheoretical Computer Science 49 (2-3) 283 (1987)
https://doi.org/10.1016/0304-3975(87)90011-9
Applications of an infinite square-free co-CFL
Michael G. Main, Walter Bucher and David HausslerTheoretical Computer Science 49 (2-3) 113 (1987)
https://doi.org/10.1016/0304-3975(87)90003-X
Sur les centres de DOL-langages
A. TerlutteRAIRO - Theoretical Informatics and Applications 21 (2) 137 (1987)
https://doi.org/10.1051/ita/1987210201371
On the intersection of the class of linear context-free languages and the class of single-reset languages
Klaus W. WagnerInformation Processing Letters 23 (3) 143 (1986)
https://doi.org/10.1016/0020-0190(86)90114-6
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
Automata, Languages and Programming
W. Bucher, A. Ehrenfeucht and D. HausslerLecture Notes in Computer Science, Automata, Languages and Programming 194 71 (1985)
https://doi.org/10.1007/BFb0015732
Automata, Languages and Programming
Michael G. Main, Walter Bucher and David HausslerLecture Notes in Computer Science, Automata, Languages and Programming 194 404 (1985)
https://doi.org/10.1007/BFb0015766
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
On total regulators generated by derivation relations
W. Bucher, A. Ehrenfeucht and D. HausslerTheoretical Computer Science 40 131 (1985)
https://doi.org/10.1016/0304-3975(85)90162-8
Non-générateurs algébriques et substitution
L. BoassonRAIRO. Informatique théorique 19 (2) 125 (1985)
https://doi.org/10.1051/ita/1985190201251
STACS 84
Jean BerstelLecture Notes in Computer Science, STACS 84 166 14 (1984)
https://doi.org/10.1007/3-540-12920-0_2
On regularity of context-free languages
A. Ehrenfeucht, D. Haussler and G. RozenbergTheoretical Computer Science 27 (3) 311 (1983)
https://doi.org/10.1016/0304-3975(82)90124-4
On a language without star
Michel LatteuxInformation Processing Letters 16 (1) 27 (1983)
https://doi.org/10.1016/0020-0190(83)90008-X
On the separating power of EOL systems
A. Ehrenfeucht and G. RozenbergRAIRO. Informatique théorique 17 (1) 13 (1983)
https://doi.org/10.1051/ita/1983170100131
Formes de langages et de grammaires
Jean -Michel Autebert, Joffroy Beauquier and Luc BoassonActa Informatica 17 (2) 193 (1982)
https://doi.org/10.1007/BF00288970
Sur la structure des langages algébriques
J. BeauquierInternational Journal of Computer Mathematics 11 (1) 3 (1982)
https://doi.org/10.1080/00207168208803295
Automata, Languages and Programming
A. Ehrenfeucht, D. Haussler and G. RozenbergLecture Notes in Computer Science, Automata, Languages and Programming 140 187 (1982)
https://doi.org/10.1007/BFb0012768
Repetitive strings are not context-free
Rockford Ross and Karl WinklmannRAIRO. Informatique théorique 16 (3) 191 (1982)
https://doi.org/10.1051/ita/1982160301911
Theoretical Computer Science
A. Ehrenfeucht and G. RozenbergLecture Notes in Computer Science, Theoretical Computer Science 104 1 (1981)
https://doi.org/10.1007/BFb0017289
Fundamentals of Computation Theory
J. BeauquierLecture Notes in Computer Science, Fundamentals of Computation Theory 117 400 (1981)
https://doi.org/10.1007/3-540-10854-8_44
Substitution of semi-AFL's
Joffroy BeauquierTheoretical Computer Science 14 (2) 187 (1981)
https://doi.org/10.1016/0304-3975(81)90056-6
Formal Language Theory
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson and Michel LatteuxFormal Language Theory 89 (1980)
https://doi.org/10.1016/B978-0-12-115350-2.50009-9
Formal Language Theory
Jean-Michel Autebert and Luc BoassonFormal Language Theory 49 (1980)
https://doi.org/10.1016/B978-0-12-115350-2.50008-7
Langages sur des alphabets infinis
Jean-Michel Autebert, Joffroy Beauquier and Luc BoassonDiscrete Applied Mathematics 2 (1) 1 (1980)
https://doi.org/10.1016/0166-218X(80)90050-5