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):

Sur la structure des langages algébriques

J. Beauquier
International Journal of Computer Mathematics 11 (1) 3 (1982)
DOI: 10.1080/00207168208803295
See this article

Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson and Michel Latteux
89 (1980)
DOI: 10.1016/B978-0-12-115350-2.50009-9
See this article

A. Ehrenfeucht, D. Haussler and G. Rozenberg
140 187 (1982)
DOI: 10.1007/BFb0012768
See this article

An infinite square-free co-CFL

Michael G. Main
Information Processing Letters 20 (2) 105 (1985)
DOI: 10.1016/0020-0190(85)90073-0
See this article

On total regulators generated by derivation relations

W. Bucher, A. Ehrenfeucht and D. Haussler
Theoretical Computer Science 40 131 (1985)
DOI: 10.1016/0304-3975(85)90162-8
See this article

On a language without star

Michel Latteux
Information Processing Letters 16 (1) 27 (1983)
DOI: 10.1016/0020-0190(83)90008-X
See this article

On regular realizability problems for context-free languages

M. N. Vyalyi and A. A. Rubtsov
Problems of Information Transmission 51 (4) 349 (2015)
DOI: 10.1134/S0032946015040043
See this article

Applications of an infinite square-free co-CFL

Michael G. Main, Walter Bucher and David Haussler
Theoretical Computer Science 49 (2-3) 113 (1987)
DOI: 10.1016/0304-3975(87)90003-X
See this article

On the intersection of stacks and queues

Franz J. Brandenburg
Theoretical Computer Science 58 (1-3) 69 (1988)
DOI: 10.1016/0304-3975(88)90019-9
See this article

Langages sur des alphabets infinis

Jean-Michel Autebert, Joffroy Beauquier and Luc Boasson
Discrete Applied Mathematics 2 (1) 1 (1980)
DOI: 10.1016/0166-218X(80)90050-5
See this article

On the intersection of the class of linear context-free languages and the class of single-reset languages

Klaus W. Wagner
Information Processing Letters 23 (3) 143 (1986)
DOI: 10.1016/0020-0190(86)90114-6
See this article

The interchange or pump (DI)lemmas for context-free languages

R. Boonyavatana and G. Slutzki
Theoretical Computer Science 56 (3) 321 (1988)
DOI: 10.1016/0304-3975(88)90138-7
See this article

On regularity of context-free languages

A. Ehrenfeucht, D. Haussler and G. Rozenberg
Theoretical Computer Science 27 (3) 311 (1983)
DOI: 10.1016/0304-3975(82)90124-4
See this article

Analytic models and ambiguity of context-free languages

Philippe Flajolet
Theoretical Computer Science 49 (2-3) 283 (1987)
DOI: 10.1016/0304-3975(87)90011-9
See this article

Sur les centres de DOL-langages

A. Terlutte
RAIRO - Theoretical Informatics and Applications 21 (2) 137 (1987)
DOI: 10.1051/ita/1987210201371
See this article

Jean-Michel Autebert and Luc Boasson
49 (1980)
DOI: 10.1016/B978-0-12-115350-2.50008-7
See this article

Iterated GSMs and Co-CFL

Jean -Michel Autebert and Joaquim Gabarr�
Acta Informatica 26 (8) 749 (1989)
DOI: 10.1007/BF00289160
See this article

A. Ehrenfeucht and G. Rozenberg
104 1 (1981)
DOI: 10.1007/BFb0017289
See this article

W. Bucher, A. Ehrenfeucht and D. Haussler
194 71 (1985)
DOI: 10.1007/BFb0015732
See this article

Formes de langages et de grammaires

Jean -Michel Autebert, Joffroy Beauquier and Luc Boasson
Acta Informatica 17 (2) 193 (1982)
DOI: 10.1007/BF00288970
See this article

Michael G. Main, Walter Bucher and David Haussler
194 404 (1985)
DOI: 10.1007/BFb0015766
See this article

Juha Kortelainen and Tuukka Salmi
6795 312 (2011)
DOI: 10.1007/978-3-642-22321-1_27
See this article

Substitution of semi-AFL's

Joffroy Beauquier
Theoretical Computer Science 14 (2) 187 (1981)
DOI: 10.1016/0304-3975(81)90056-6
See this article

Patrice Séébold
380 384 (1989)
DOI: 10.1007/3-540-51498-8_37
See this article

An “Interchange Lemma” for Context-Free Languages

William Ogden, Rockford J. Ross and Karl Winklmann
SIAM Journal on Computing 14 (2) 410 (1985)
DOI: 10.1137/0214031
See this article

59 (1990)
DOI: 10.1016/B978-0-444-88074-1.50007-X
See this article

On the separating power of EOL systems

A. Ehrenfeucht and G. Rozenberg
RAIRO. Informatique théorique 17 (1) 13 (1983)
DOI: 10.1051/ita/1983170100131
See this article

Non-générateurs algébriques et substitution

L. Boasson
RAIRO. Informatique théorique 19 (2) 125 (1985)
DOI: 10.1051/ita/1985190201251
See this article

Repetitive strings are not context-free

Rockford Ross and Karl Winklmann
RAIRO. Informatique théorique 16 (3) 191 (1982)
DOI: 10.1051/ita/1982160301911
See this article