Deux propriétés décidables des suites récurrentes linéaires

DOI10.24033/bsmf.1823zbMath0329.10009OpenAlexW2585298200MaRDI QIDQ4094921

Jean Berstel, Maurice Mignotte

Publication date: 1976

Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=BSMF_1976__104__175_0

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Recurrences (11B37) Decidability of theories and sets of sentences (03B25)

Related Items (39)

Occurrence of zero in a linear recursive sequence ⋮ RESULTS CONCERNING THINNESS OF D0L LANGUAGES ⋮ Effective results on the Skolem problem for linear recurrence sequences ⋮ A modular method for computing the Galois groups of polynomials ⋮ Unnamed Item ⋮ On recurrence sequences with polynomial coefficients ⋮ Unnamed Item ⋮ On the Skolem problem and some related questions for parametric families of linear recurrence sequences ⋮ Effective asymptotics of linear recurrences with rational coefficients ⋮ On some decidability problems for HDOL systems with nonsingular Parikh matrices ⋮ Between the Rings $${\mathbb Z}/p^n{\mathbb Z}$$ and the Ring $${\mathbb Z}_p$$: Issues of Axiomatizability, Definability and Decidability ⋮ Order bounds for C2-finite sequences ⋮ What's decidable about discrete linear dynamical systems? ⋮ Recurrence relations, succession rules and the positivity problem ⋮ Reachability in Linear Dynamical Systems ⋮ On the abc$abc$ conjecture in algebraic number fields ⋮ Solving Skolem's problem for the \(k\)-generalized Fibonacci sequence with negative indices ⋮ D0L sequence equivalence is inPfor fixed alphabets ⋮ Testing degenerate polynomials ⋮ Unnamed Item ⋮ Decidability of Skolem matrix emptiness problem entails constructability of exact regular expression ⋮ Computing Omega-Limit Sets in Linear Dynamical Systems ⋮ Fast computation of special resultants ⋮ ROOTS OF UNITY AS QUOTIENTS OF TWO ROOTS OF A POLYNOMIAL ⋮ Positivity of third order linear recurrence sequences ⋮ Explicit test sets for iterated morphisms in free monoids and metabelian groups ⋮ Positivity of second order linear recurrent sequences ⋮ The continuous Skolem-Pisot problem ⋮ Positive rational sequences ⋮ Zeros of Z-rational functions and DOL equivalence ⋮ Recurrence Relations, Succession Rules, and the Positivity Problem ⋮ Intersection des images de certaines suites recurrentes linéaires ⋮ On the zero-multiplicity of the k-generalized Fibonacci sequence ⋮ On D0L power series ⋮ On the multiplicities of Padovan-type sequences ⋮ Unnamed Item ⋮ An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet ⋮ An extension of holonomic sequences: \(C^2\)-finite sequences ⋮ 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
• Algorithms related to the decomposition of polynomials
• Note on an arithmetical property of recurring series
• Approximate formulas for some functions of prime numbers
• A note on recurring series
• On the Zeros of a Cubic Recurrence
• On a theorem concerning exponential polynomials
• A note on linear recursive sequences
• Factorisation de fractions rationnelles et de suites récurrentes
• Algèbres de Hadamard

This page was built for publication: Deux propriétés décidables des suites récurrentes linéaires