Academic Journal
Bounded Length UCFG Equivalence
| Title: | Bounded Length UCFG Equivalence |
|---|---|
| Authors: | B. Litow |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://www.cs.jcu.edu.au/ftp/pub/techreports/96-2.ps.gz. |
| Publication Year: | 1996 |
| Collection: | CiteSeerX |
| Description: | A randomised polylog time algorithm is given for deciding whether or not the sets of words of a given length generated by two unambiguous context-free grammars coincide. The algorithm is in randomised NC4 in terms of the product of the grammar size and the length. |
| Document Type: | text |
| File Description: | application/postscript |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.9665 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.9665 http://www.cs.jcu.edu.au/ftp/pub/techreports/96-2.ps.gz |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.B893DE70 |
| Database: | BASE |
| Description not available. |