Deciding whether the ordering is necessary in a Presburger formula

Deciding whether the ordering is necessary in a Presburger formula

Automata, Logic and Semantics

Bibliographic Details
Main Authors:	Christian Choffrut, Achille Frigeri
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2010-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	presburger arithmetics [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/510/pdf

Similar Items

Directed figure codes are decidable
by: Michal Kolarz, et al.
Published: (2009-01-01)

Shifts with decidable language and non-computable entropy
by: Peter Hertling, et al.
Published: (2008-01-01)

Random Horn formulas and propagation connectivity for directed hypergraphs
by: Robert H. Sloan, et al.
Published: (2012-08-01)

The unreasonable ubiquitousness of quasi-polynomials
by: Kevin Woods
Published: (2013-01-01)

A chip-firing variation and a new proof of Cayley's formula
by: Peter Mark Kayll, et al.
Published: (2013-03-01)

On symmetric structures of order two
by: Michel Bousquet, et al.
Published: (2008-01-01)

On the complexity of the balanced vertex ordering problem
by: Jan Kára, et al.
Published: (2007-01-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

Generating involutions, derangements, and relatives by ECO
by: Vincent Vajnovszki
Published: (2010-01-01)

On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
by: Nicolas Bédaride, et al.
Published: (2010-01-01)

Asymptotic results for silent elimination
by: Guy Louchard, et al.
Published: (2010-01-01)

Ore and Erdős type conditions for long cycles in balanced bipartite graphs
by: Janusz Adamus, et al.
Published: (2009-01-01)

A construction of small regular bipartite graphs of girth 8
by: Camino Balbuena
Published: (2009-01-01)

Computation of L_⊕ for several cubic Pisot numbers
by: Julien Bernat
Published: (2007-01-01)

Structure of spanning trees on the two-dimensional Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2011-01-01)

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
by: Gábor Bacsó, et al.
Published: (2009-01-01)

On the k-restricted structure ratio in planar and outerplanar graphs
by: Gruia Călinescu, et al.
Published: (2008-01-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

Regular languages and associative language descriptions
by: Marcella Anselmo, et al.
Published: (2007-01-01)

On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-01-01)

Tribes of cubic partial cubes
by: Sandi Klavžar, et al.
Published: (2007-01-01)

Leftmost derivations of propagating scattered context grammars: a new proof
by: Tomáš Masopust, et al.
Published: (2008-01-01)

A perimeter enumeration of column-convex polyominoes
by: Svjetlan Feretić
Published: (2007-01-01)

Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01)

Asymptotic enumeration on self-similar graphs with two boundary vertices
by: Elmar Teufl, et al.
Published: (2009-01-01)

Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)

q-Enumeration of words by their total variation
by: Ligia Loreta Cristea, et al.
Published: (2011-01-01)

Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation
by: Philippe Dumas, et al.
Published: (2007-01-01)

The distribution of ascents of size d or more in compositions
by: Charlotte Brennan, et al.
Published: (2009-01-01)

The Variance of the Profile in Digital Search Trees
by: Ramin Kazemi, et al.
Published: (2011-09-01)

The analysis of find and versions of it
by: Diether Knof, et al.
Published: (2012-09-01)

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
by: Thomas P. Hayes
Published: (2011-11-01)

Negative bases and automata
by: Christiane Frougny, et al.
Published: (2011-04-01)

Robot's hand and expansions in non-integer bases
by: Paola Loreti, et al.
Published: (2014-06-01)

On 4-valent Frobenius circulant graphs
by: Sanming Zhou
Published: (2012-10-01)

Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)

On neighbour-distinguishing colourings from lists
by: Mirko Horňák, et al.
Published: (2012-08-01)

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Network
by: Antonio Fernández Anta, et al.
Published: (2011-04-01)

List circular backbone colouring
by: Frederic Havet, et al.
Published: (2014-01-01)

The Erdős-Sós conjecture for geometric graphs
by: Luis Barba, et al.
Published: (2013-02-01)