The complexity of computing the number of strings of given length in context-free languages-Reference-Cited by-同舟云学术

The complexity of computing the number of strings of given length in context-free languages

Published:1991-09 Issue:2 Volume:86 Page:325-342
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bertoni Alberto,Goldwurm Massimiliano,Sabadini Nicoletta

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference36 articles.

1. The characterization of nonexpansive grammars by rational power series;Baron;Inform. and Control,1981

2. Log depth circuits for division and related problems;Beame;SIAM J. Comput.,1986

3. On computing the determinant in small parallel time using a small number of processors;Berkowitz;Inform. Process. Lett.,1984

4. A characterization of the class of functions computable in polynomial time by Random Access Machine;Bertoni;Proc. 13th ACM Symp. on Theory of Computing,1981

5. On relating time and space to size and depth;Borodin;SIAM J. Comput.,1977

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shaping Test Inputs in Grammar-Based Fuzzing;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11

2. Closure and nonclosure properties of the classes of compressible and rankable sets;Journal of Computer and System Sciences;2021-09

3. Closure and Nonclosure Properties of the Compressible and Rankable Sets;Language and Automata Theory and Applications;2019

4. Generating, Sampling and Counting Subclasses of Regular Tree Languages;Theory of Computing Systems;2012-10-26

5. Some Applications of the Schutzenberger-Bertoni Method;Electronic Notes in Discrete Mathematics;2011-08