Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/1063
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGELADE, Wouter-
dc.date.accessioned2006-11-29T08:44:28Z-
dc.date.available2006-11-29T08:44:28Z-
dc.date.issued2006-
dc.identifier.urihttp://hdl.handle.net/1942/1063-
dc.format.extent1065696 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.subject.otherTuring machine, Tiling, regular expressions, tree languages, unranked tree automata-
dc.titleOptimization of XML schema languages: complexity of counting and the shuffle operator-
dc.typeTheses and Dissertations-
local.format.pages122-
local.bibliographicCitation.jcatT2-
local.type.specifiedMaster thesis-
dc.bibliographicCitation.oldjcat-
item.fulltextWith Fulltext-
item.contributorGELADE, Wouter-
item.fullcitationGELADE, Wouter (2006) Optimization of XML schema languages: complexity of counting and the shuffle operator.-
item.accessRightsOpen Access-
Appears in Collections:Master theses
Files in This Item:
File Description SizeFormat 
gelade_wouter.pdf1.04 MBAdobe PDFView/Open
Show simple item record

Page view(s)

34
checked on Jul 1, 2022

Download(s)

10
checked on Jul 1, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.