Computability of recurrence equations

DOI10.1016/0304-3975(93)90326-OzbMath0780.65078MaRDI QIDQ685372

Yannick Saouter, Patrice Quinton

Publication date: 23 January 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

computabilityparallel architecturesregular iterative arrayssystems of uniform recurrence equationssystolic array synthesis

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Distributed algorithms (68W15)

Related Items

Undecidability of restricted uniform recurrence equations ⋮ Computability of recurrence equations ⋮ Some efficient solutions to the affine scheduling problem. I: One- dimensional time ⋮ Geometrical tools to map systems of affine recurrence equations on regular arrays

Cites Work

• Computability of recurrence equations
• On the computational power of pushdown automata
• The mapping of linear recurrence equations on regular arrays
• The Organization of Computations for Uniform Recurrence Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item