Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
21
views
6
references
Top references
cited by
13
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,433
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Trees in Algebra and Programming — CAAP '96
Diophantine equations, Presburger arithmetic and finite automata
other
Author(s):
Alexandre Boudet
,
Hubert Comon
Publication date
(Online):
June 2 2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Most cited references
6
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Word problems requiring exponential time(Preliminary Report)
L. J. Stockmeyer
,
A. R. Meyer
(1973)
0
comments
Cited
85
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata on Infinite Objects
Wolfgang Thomas
(1990)
0
comments
Cited
83
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations
E Contejean
,
H. Devie
(1994)
0
comments
Cited
14
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1996
Publication date (Online):
June 2 2005
Pages
: 30-43
DOI:
10.1007/3-540-61064-2_27
SO-VID:
f8e739cb-342e-4b68-a00c-f1e7b9d79f0e
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 30
Diophantine equations, Presburger arithmetic and finite automata
Similar content
1,433
Unary counting quantifiers do not increase the expressive power of Presburger aritmetic: an alternative shorter proof
Authors:
Christian Choffrut
Counting solutions to Presburger formulas
Authors:
William Pugh
Efficient temporal-logic query checking for presburger systems
Authors:
Dezhuang Zhang
,
Rance Cleaveland
See all similar
Cited by
13
On the expressiveness of real and integer arithmetic automata
Authors:
Bernard Boigelot
,
Stéphane Rassart
,
Pierre Wolper
FAST: acceleration from theory to practice
Authors:
Alain Finkel
,
Sébastien Bardin
,
Laure Petrucci
…
On the Construction of Automata from Linear Arithmetic Constraints
Authors:
Pierre Wolper
,
Bernard Boigelot
See all cited by