On iterating linear transformations over recognizable sets of integers
type: Item
instance of: scholarly article
title: On iterating linear transformations over recognizable sets of integers
zbMATH Open document ID: 1070.68062
DOI: 10.1016/S0304-3975(03)00314-1
author: B. Boigelot
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 2111001
zbMATH Keywords: Automata
zbMATH Keywords: Iterations
zbMATH Keywords: Presburger arithmetic
zbMATH Keywords: Recognizable sets of integers
describes a project that uses: LASH
describes a project that uses: MONA
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q3259278
cites work: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
cites work: Diophantine equations, Presburger arithmetic and finite automata
cites work: Logic and \(p\)-recognizable sets of integers
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: On the base-dependence of sets of numbers recognizable by finite automata
cites work: A uniform method for proving lower bounds on the computational complexity of logical theories
cites work: The computational complexity of logical theories
cites work: Q5562645
cites work: Q3999066
cites work: Q4722056
cites work: Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
cites work: A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
cites work: Presburgerness of predicates regular in two number systems
cites work: Q4200153
cites work: The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
cites work: Q4518891
full work available at URL: s0304-3975(03)00314-1
OpenAlex ID: W2119296125
description: scientific article; zbMATH DE number 2111001