A shrinking lemma for random forbidding context languages.
dc.contributor.author | Van Der Walt APJ | |
dc.contributor.author | Ewert S | |
dc.date.accessioned | 2013-01-23T10:10:44Z | |
dc.date.available | 2013-01-23T10:10:44Z | |
dc.date.issued | 2000 | |
dc.description | Natuurwetenskappe | |
dc.description | Rekenaarwetenskap | |
dc.description | Please help us populate SUNScholar with the post print version of this article. It can be e-mailed to: scholar@sun.ac.za | |
dc.identifier.citation | Theoretical Computer Science | |
dc.identifier.uri | http://hdl.handle.net/10019.1/72483 | |
dc.publisher | ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE | |
dc.title | A shrinking lemma for random forbidding context languages. | |
dc.type | Journal Articles (subsidised) |