Computing a context-free grammar-generating series
Litow, Bruce (2001) Computing a context-free grammar-generating series. Information and Computation, 169 (2). pp. 174-185.
![[img]](http://eprints.jcu.edu.au/style/images/fileicons/application_pdf.png) | PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 80Kb |
View at Publisher Website: http://dx.doi.org/10.1006/inco.2000.3023
Abstract
The parallel complexity of computingcontext-freegrammargeneratingseries 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.
| ID Code: | 13230 |
|---|---|
| Item Type: | Article (Refereed Research - C1) |
| Keywords: | context-free grammar generating series |
| FoR Codes: | 08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified @ 100% |
| SEO Codes: | 89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100% |
| Deposited On: | 26 Jul 2012 17:16 |
| Last Modified: | 11 Dec 2012 12:47 |
| Downloads: | Total: 2 Last 12 Months: 1 |
| Statistics: | More Statistics |
Repository Staff Only: item control page