Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/1063Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | GELADE, Wouter | - |
| dc.date.accessioned | 2006-11-29T08:44:28Z | - |
| dc.date.available | 2006-11-29T08:44:28Z | - |
| dc.date.issued | 2006 | - |
| dc.identifier.uri | http://hdl.handle.net/1942/1063 | - |
| dc.format.extent | 1065696 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en | - |
| dc.subject.other | Turing machine, Tiling, regular expressions, tree languages, unranked tree automata | - |
| dc.title | Optimization of XML schema languages: complexity of counting and the shuffle operator | - |
| dc.type | Theses and Dissertations | - |
| local.format.pages | 122 | - |
| local.bibliographicCitation.jcat | T2 | - |
| local.type.specified | Master thesis | - |
| dc.bibliographicCitation.oldjcat | - | |
| item.fulltext | With Fulltext | - |
| item.fullcitation | GELADE, Wouter (2006) Optimization of XML schema languages: complexity of counting and the shuffle operator. | - |
| item.contributor | GELADE, Wouter | - |
| item.accessRights | Open Access | - |
| Appears in Collections: | Master theses | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| gelade_wouter.pdf | 1.04 MB | Adobe PDF | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.