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

Authors:
Alberto Bertoni;Massimiliano Goldwurm;Nicoletta Sabadini
Affiliations:
Univ. delgi Studi di Milano, Milan, Italy;Univ. delgi Studi di Milano, Milan, Italy;Univ. delgi Studi di Milano, Milan, Italy
Venue:
Theoretical Computer Science
Year:
1991

Citing 0
Cited 4

Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Enumeration of context-free languages and related structures

Journal of Automata, Languages and Combinatorics
Generating, sampling and counting subclasses of regular tree languages

Proceedings of the 14th International Conference on Database Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract