Context-free languages with rational index in $\Theta (n^\gamma )$ for algebraic numbers $\gamma $
RAIRO-Theor. Inf. Appl., 24 3 (1990) 275-322
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):
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees
Ekaterina Shemetova, Alexander Okhotin and Semyon GrigorevTheory of Computing Systems 68 (3) 487 (2024)
https://doi.org/10.1007/s00224-023-10159-3
Developments in Language Theory
Ekaterina Shemetova, Alexander Okhotin and Semyon GrigorevLecture Notes in Computer Science, Developments in Language Theory 13257 263 (2022)
https://doi.org/10.1007/978-3-031-05578-2_21
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
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
Rational indexes of generators of the cone of context-free languages
Laurent PierreTheoretical Computer Science 95 (2) 279 (1992)
https://doi.org/10.1016/0304-3975(92)90269-L