Definability and Compression

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Afrati, F en
dc.contributor.author Leiß, H en
dc.contributor.author Rougemont, M en
dc.date.accessioned 2014-03-01T02:48:57Z
dc.date.available 2014-03-01T02:48:57Z
dc.date.issued 2000 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/34154
dc.subject Compression Algorithm en
dc.subject Transitive Closure en
dc.subject 2 dimensional en
dc.subject First Order en
dc.subject First Order Logic en
dc.subject lempel ziv en
dc.subject Monadic Second Order en
dc.subject Run Length Encoding en
dc.subject Second Order en
dc.title Definability and Compression en
heal.type conferenceItem en
heal.identifier.primary 10.1109/LICS.2000.855756 en
heal.identifier.secondary http://dx.doi.org/10.1109/LICS.2000.855756 en
heal.publicationDate 2000 en
heal.abstract A compression algorithm takes a finite structure of a class K as input and produces a finite structure of a dif- ferent class K' as output. Given a property on the class K defined in a logic , we study the definability of property on the class K'. We consider two compression schemas on unary ordered structures (words), compression by en
heal.journalName Logic in Computer Science en
dc.identifier.doi 10.1109/LICS.2000.855756 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record