Conference item icon

Conference item

The taming of the semi-linear set

Abstract:

Semi-linear sets, which are rational subsets of the monoid (Z^d,+), have numerous applications in theoretical computer science. Although semi-linear sets are usually given implicitly, by formulas in Presburger arithmetic or by other means, the effect of Boolean operations on semi-linear sets in terms of the size of description has primarily been studied for explicit representations. In this paper, we develop a framework suitable for implicitly presented semi-linear sets, in which the size of ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.4230/LIPIcs.ICALP.2016.128

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
Schloss Dagstuhl
Host title:
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Series:
Leibniz International Proceedings in Informatics
Journal:
International Colloquium on Automata, Languages, and Programming More from this journal
Volume:
55
Pages:
128:1--128:13
Publication date:
2016-08-17
Acceptance date:
2016-04-15
DOI:
ISSN:
1868-8969
ISBN:
9783959770132
Keywords:
Pubs id:
pubs:635015
UUID:
uuid:7205ba8c-3a7f-44c3-80b5-54b8ecbda474
Local pid:
pubs:635015
Source identifiers:
635015
Deposit date:
2016-07-22

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP