Comparing the Succinctness of Monadic Query Languages over Finite Trees release_psdjunqwiffs7j4u7jjhuvkdcq

by Martin Grohe, Nicole Schweikardt

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2003   p226-240

Archived Files and Locations

application/pdf  345.1 kB
file_nywb7wxtvrdw3ctykvxujdyth4
web.archive.org (webarchive)
web.archive.org (webarchive)
www.inf.ed.ac.uk (web)
www.tks.informatik.uni-frankfurt.de (web)
web.archive.org (webarchive)
+ 1 more URLs
application/pdf  368.2 kB
file_hmz4ldx27zbbzeawpizep2yjou
www.numdam.org (web)
web.archive.org (webarchive)
application/pdf  262.2 kB
file_6rzugbaslrapjk3jbokpvofwui
web.archive.org (webarchive)
www.tks.cs.uni-frankfurt.de (web)
www.tks.informatik.uni-frankfurt.de (web)
web.archive.org (webarchive)
application/pdf  176.9 kB
file_34nfywxakjedrageupkqsys4nm
www.tks.informatik.uni-frankfurt.de (web)
web.archive.org (webarchive)
web.archive.org (webarchive)
web.archive.org (webarchive)
www.tks.informatik.uni-frankfurt.de (web)
Read Archived PDF
Preserved and Accessible
Type  chapter
Stage   published
Year   2003
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 93cf1528-11d9-47a2-82af-e867b444e7f4
API URL: JSON