Counting the solutions of Presburger equations without enumerating them.
type: Item
instance of: scholarly article
title: Counting the solutions of Presburger equations without enumerating them.
zbMATH Open document ID: 1069.68063
author: B. Boigelot
author: Louis Latour
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
full work available at URL: http://orbi.ulg.ac.be/handle/2268/74856
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 2056573
zbMATH Keywords: Presburger arithmetic
zbMATH Keywords: Automata
zbMATH Keywords: Counting
zbMATH Keywords: Symbolic representation systems
describes a project that uses: LASH
MaRDI profile type: Publication
OpenAlex ID: W2052987729
cites work: Diophantine equations, Presburger arithmetic and finite automata
cites work: Logic and \(p\)-recognizable sets of integers
cites work: On the base-dependence of sets of numbers recognizable by finite automata
cites work: Proving safety properties of infinite state systems by compilation into Presburger arithmetic
cites work: Handling infinite temporal data
cites work: Location, scheduling, design and integer programming
cites work: Q3818127
cites work: Presburgerness of predicates regular in two number systems
cites work: Q4518891
DOI: 10.1016/J.TCS.2003.10.002
description: scientific article; zbMATH DE number 2056573