@article{10.1006/inco.2000.3023,
Abstract = {The parallel complexity of computing context-free grammar generating series is investigated. It is known that this problem is in DIV, but in terms of n rather than n, where n is the index of the desired coefficient and is the grammar size. A new method is presented which is in DIV in terms of 22O( ) n. Evidence is provided that any direct application of elimination theory to this problem leads to a space and time resource factor that is nearly exponential in grammar size.},
Address = {USA},
Author = {Litow, Bruce},
File = {Computing a Context-Free Grammar-Generating Series - 1-s2.0-S0890540100930232-main.pdf},
ISSN = {0890-5401},
Journal = {Inf. Comput.},
Month = {sep},
Number = {2},
Pages = {174--185},
Publisher = {Academic Press, Inc.},
Title = {Computing a Context-Free Grammar-Generating Series},
URL = {https://doi.org/10.1006/inco.2000.3023},
Volume = {169},
Year = {2001},
bdsk-url-1 = {https://doi.org/10.1006/inco.2000.3023},
date-added = {2022-01-14 13:40:13 +0100},
date-modified = {2022-01-14 13:40:13 +0100},
issue_date = {September 15, 2001},
numpages = {12},
doi = {10.1006/inco.2000.3023}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A