Computability of recurrence equations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3976313 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- Computability of recurrence equations
- On the computational power of pushdown automata
- The Organization of Computations for Uniform Recurrence Equations
- The mapping of linear recurrence equations on regular arrays
Cited in
(9)- Geometrical tools to map systems of affine recurrence equations on regular arrays
- Computations of uniform recurrence equations using minimal memory size
- An undecidable nested recurrence relation
- Computability of recurrence equations
- scientific article; zbMATH DE number 2090598 (Why is no real title available?)
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Computability of affine non-conditional recurrent systems
- New results on computability of recurrence equations
- Undecidability of restricted uniform recurrence equations
This page was built for publication: Computability of recurrence equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685372)
