Convex Hull of Arithmetic Automata

Simple item page
dc.creatorLeroux, Jérôme
dc.date2008-12-10
dc.date.accessioned2026-07-07T12:11:44Z
dc.date.available2026-07-07T12:11:44Z
dc.descriptionArithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata.
dc.identifierhttps://arxiv.org/abs/0812.2014
dc.identifierhttp://arxiv.org/abs/0812.2014
dc.identifierStatic Analysis, Valencia : Espagne (2008)
dc.identifierdoi:10.1007/978-3-540-69166-2_4
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210318
dc.subjectData Structures and Algorithms
dc.titleConvex Hull of Arithmetic Automata
dc.typetext

Files

Collections

arXiv