First-order orbit queries

DOI10.1007/s00224-020-09976-7OpenAlexW3014334551MaRDI QIDQ2048201

James Worrell, Shaull Almagor, Joël Ouaknine

Publication date: 5 August 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:76e1f714-ee9e-4f0c-9e0b-36751280790e

zbMATH Keywords

linear dynamical systemsorbit problemfirst-order theory of the reals

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Logic in computer science (03B70) Metric theory (11J83) Low-dimensional dynamical systems (37E99) Linear forms in logarithms; Baker's method (11J86)

Related Items (2)

What's decidable about discrete linear dynamical systems? ⋮ Algebraic model checking for discrete linear dynamical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Occurrence of zero in a linear recursive sequence
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Computing polynomial program invariants
• Logarithmic forms and group varieties.
• On the Complexity of the Orbit Problem
• Polynomial-time algorithm for the orbit problem
• Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
• The Polyhedron-Hitting Problem
• Algorithms in real algebraic geometry
• Symbolic reachability computation for families of linear vector fields

This page was built for publication: First-order orbit queries