Uniform Random Generation of Strings in a Context-Free Language
- 1 November 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (4) , 645-655
- https://doi.org/10.1137/0212044
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Upper Bounds for Speedup in Parallel ParsingJournal of the ACM, 1982
- Probabilistic Languages: A Review and Some Open QuestionsACM Computing Surveys, 1980
- Uniform Random Generation of Balanced Parenthesis StringsACM Transactions on Programming Languages and Systems, 1980
- Analyses of deterministic parsing algorithmsCommunications of the ACM, 1978
- Automatic solution of a certain class of combinatorial problemsInformation Processing Letters, 1977