Reachability in linear recurrence automata

DOI10.1007/978-3-031-72621-7_12MaRDI QIDQ7405576zbMATH OpenFDO

Authors Mika Hirvensalo, Akitoshi Kawamura, Igor Potapov, Takao Yuyama

Publication date 2024

Full work available at URL https://doi.org/10.1007/978-3-031-72621-7_12

zbMATH Keywords

linear recurrencesmatrix semigroupsreachability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Developments in Language Theory
• Improved matrix pair undecidability results
• Linear loop synthesis for quadratic invariants
• Mathematical Foundations of Computer Science 2004
• MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
• Numeration systems, linear recurrences, and regular sets
• On Affine Reachability Problems
• On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
• On the Skolem problem and the Skolem conjecture
• On the Skolem problem for reversible sequences
• On undecidability bounds for matrix decision problems
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers
• Skolem meets schanuel
• The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
• Undecidability bounds for integer matrices using Claus instances

This page was built for publication: Reachability in linear recurrence automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7405576)