The complexity of computing the number of strings of given length in context-free languages
- 1 September 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 86 (2) , 325-342
- https://doi.org/10.1016/0304-3975(91)90023-u
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Analytic models and ambiguity of context-free languagesTheoretical Computer Science, 1987
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- Algebraic languages and polyominoes enumerationTheoretical Computer Science, 1984
- Planar Maps are Well Labeled TreesCanadian Journal of Mathematics, 1981
- The characterization of nonexpansive grammars by rational power seriesInformation and Control, 1981
- Formal languages and enumerationJournal of Combinatorial Theory, Series A, 1978
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- Enumeration des graphes planaires a l'aide des series formelles en variables non commutativesDiscrete Mathematics, 1972