Non-générateurs algébriques et substitution
RAIRO. Inform. théor., 19 2 (1985) 125-136
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):
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
Descriptional Complexity of Formal Systems
A. Rubtsov and M. VyalyiLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 9118 256 (2015)
https://doi.org/10.1007/978-3-319-19225-3_22
Context-free languages with rational index in $\Theta (n^\gamma )$ for algebraic numbers $\gamma $
Laurent Pierre and Jean-Marc FarinoneRAIRO - Theoretical Informatics and Applications 24 (3) 275 (1990)
https://doi.org/10.1051/ita/1990240302751
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
Rational index of context-free languages in exp Θ(Pn)andnΘ,((ln n)1p)
Laurent Pierre and Jean-Marc FarinoneTheoretical Computer Science 57 (2-3) 185 (1988)
https://doi.org/10.1016/0304-3975(88)90038-2
Langages algébriques déterministes non générateurs
L. Boasson and A. PetitRAIRO - Theoretical Informatics and Applications 21 (1) 41 (1987)
https://doi.org/10.1051/ita/1987210100411