Academic Journal
A Size Efficient Polylog Time Context-Free Language Recognition Algorithm
| Title: | A Size Efficient Polylog Time Context-Free Language Recognition Algorithm |
|---|---|
| Authors: | B. Litow |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://www.cs.jcu.edu.au/ftp/pub/techreports/95-5.ps.gz. |
| Collection: | CiteSeerX |
| Subject Terms: | computational complexity, parallel algorithms |
| Description: | This paper presents a simple NC3 CFL recognition algorithm, using the Boolean circuit model. The algorithm requires O(n |
| Document Type: | text |
| File Description: | application/postscript |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.145 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.145 http://www.cs.jcu.edu.au/ftp/pub/techreports/95-5.ps.gz |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.FEFD3EC4 |
| Database: | BASE |
| Description not available. |