Computability of recurrence equations

DOI10.1016/0304-3975(93)90326-OzbMATH Open0780.65078MaRDI QIDQ685372FDOQ685372

Yannick Saouter, Patrice Quinton

Publication date: 23 January 1994

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

Recommendations

• New results on computability of recurrence equations
• Undecidability of restricted uniform recurrence equations
• scientific article; zbMATH DE number 1555966
• Computability of affine non-conditional recurrent systems
• scientific article

zbMATH Keywords

parallel architecturescomputabilityregular iterative arrayssystems of uniform recurrence equationssystolic array synthesis

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the computational power of pushdown automata
• Title not available (Why is that?)
• The Organization of Computations for Uniform Recurrence Equations
• Title not available (Why is that?)
• The mapping of linear recurrence equations on regular arrays
• Computability of recurrence equations

Cited In (7)

• Computability of recurrence equations
• Computability of affine non-conditional recurrent systems
• Undecidability of restricted uniform recurrence equations
• Geometrical tools to map systems of affine recurrence equations on regular arrays
• Title not available (Why is that?)
• Computations of uniform recurrence equations using minimal memory size
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time

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)