On iterating linear transformations over recognizable sets of integers
From MaRDI portal
Publication:1884908
DOI10.1016/S0304-3975(03)00314-1zbMath1070.68062OpenAlexW2119296125MaRDI QIDQ1884908
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00314-1
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (9)
A Calculus for Modular Loop Acceleration ⋮ Algebraic program analysis ⋮ Model-checking CTL* over flat Presburger counter systems ⋮ A New Acceleration-Based Combination Framework for Array Properties ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Unnamed Item ⋮ Iterating Octagons ⋮ Accelerating Interpolation-Based Model-Checking ⋮ Flat Petri nets (invited talk)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A uniform method for proving lower bounds on the computational complexity of logical theories
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- The computational complexity of logical theories
- Presburgerness of predicates regular in two number systems
- Logic and \(p\)-recognizable sets of integers
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Weak Second‐Order Arithmetic and Finite Automata
- On the base-dependence of sets of numbers recognizable by finite automata
- Diophantine equations, Presburger arithmetic and finite automata
This page was built for publication: On iterating linear transformations over recognizable sets of integers
