On the public citation graph
Deciding ω-regular properties on linear recurrence sequences
0 signed · 38 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpa.3160120306openalex-snapshot
On a theorem concerning exponential polynomials
inferredcites →https://doi.org/10.1006/inco.2001.3139openalex-snapshot
The Monadic Theory of Morphic Infinite Words and Generalizations
inferredcites →https://doi.org/10.1007/3-540-45793-3_21openalex-snapshot
A Logic of Probability with Decidable Model-Checking
inferredcites →https://doi.org/10.1007/978-1-4612-4220-8openalex-snapshot
Introduction to Diophantine Approximations
inferredcites →https://doi.org/10.1007/978-1-4612-6264-0openalex-snapshot
Automata-Theoretic Aspects of Formal Power Series
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_28openalex-snapshot
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1016/j.ic.2006.12.004openalex-snapshot
On decidability of monadic logic of order over the naturals extended by monadic predicates
inferredcites →https://doi.org/10.1016/j.ic.2020.104598openalex-snapshot
Regular ω-languages with an informative right congruence
inferredcites →https://doi.org/10.1016/s0079-8169(04)x8001-6openalex-snapshot
Infinite Words - Automata, Semigroups, Logic and Games
inferredcites →https://doi.org/10.1016/s0304-3975(02)00847-2openalex-snapshot
Almost periodic sequences
inferredcites →https://doi.org/10.1017/cbo9780511897184.016openalex-snapshot
Linear relations on algebraic groups
inferredcites →https://doi.org/10.1070/im1984v022n03abeh001456openalex-snapshot
LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
inferredcites →https://doi.org/10.1093/logcom/exl004openalex-snapshot
A Logic of Probability with Decidable Model Checking
inferredcites →https://doi.org/10.1137/1.9781611973402.27openalex-snapshot
Positivity Problems for Low-Order Linear Recurrence Sequences
inferredcites →https://doi.org/10.1145/2629417openalex-snapshot
Approximate Verification of the Symbolic Dynamics of Markov Chains
inferredcites →https://doi.org/10.1515/crll.1984.349.63openalex-snapshot
The distance between terms of an algebraic recurrence sequence.
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.2307/2269808openalex-snapshot
Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
inferredcites →https://doi.org/10.2307/2275227openalex-snapshot
Decidability and undecidability of theories with a predicate for the primes
inferredcites →https://doi.org/10.24033/bsmf.1823openalex-snapshot
Deux propriétés décidables des suites récurrentes linéaires
inferredcites →https://doi.org/10.4204/eptcs.277.19openalex-snapshot
Regular omega-Languages with an Informative Right Congruence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_39openalex-snapshot
On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_13openalex-snapshot
Affine Loop Invariant Generation via Matrix Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-15839-1_1openalex-snapshot
Algebraic Model Checking for Discrete Linear Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_2openalex-snapshot
What’s Decidable About Discrete Linear Dynamical Systems?
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_3openalex-snapshot
Model Checking Linear Dynamical Systems under Floating-point Rounding
inferred← citeshttps://doi.org/10.1007/978-3-031-75775-4_13openalex-snapshot
Model Checking Markov Chains as Distribution Transformers
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106481openalex-snapshot
Skolem and positivity completeness of ergodic Markov chains
inferred← citeshttps://doi.org/10.1016/j.nahs.2026.101680openalex-snapshot
Linear dynamical systems with weight functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114959openalex-snapshot
The monadic theory of toric words
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175758openalex-snapshot
The Power of Positivity
inferred← citeshttps://doi.org/10.1142/s0218271826500513openalex-snapshot
Decidability, observational bridges and finite-information quantum gravity
inferred← citeshttps://doi.org/10.1145/3531130.3532399openalex-snapshot
Computing the Density of the Positivity Set for Linear Recurrence Sequences
inferred← citeshttps://doi.org/10.1145/3632897openalex-snapshot
Monotonicity and the Precision of Program Analysis
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.