Topological transformations as a tool in the design of systolic networks

DOI10.1016/0304-3975(85)90091-XMaRDI QIDQ1069704zbMATH OpenOpenAlexFDO

Authors Karel II Culik, Ivan Friš

Publication date 1985

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

Full work available at URL https://doi.org/10.1016/0304-3975(85)90091-x

zbMATH Keywords

simulationequivalenceisomorphismparallel processingcomputational networkspace-time diagramsunrollings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Cellular automata (computational aspects) (68Q80) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On totalistic systolic networks
• On the capabilities of systolic systems
• The application of a sequence notation to the design of systolic computations
• scientific article; zbMATH DE number 4060727
• Publication:4728253

Cites work

• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 3872685 (Why is no real title available?)
• scientific article; zbMATH DE number 3911718 (Why is no real title available?)
• scientific article; zbMATH DE number 3952666 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3628373 (Why is no real title available?)
• A characterization of systolic binary tree automata and applications
• Deterministic one-way simulation of two-way real-time cellular automata and its related problems
• Folding of the plane and the design of systolic arrays
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• Iterative arrays with direct central control
• Iterative tree automata
• On real-time cellular automata and trellis automata
• One-way bounded cellular automata
• Parallel Processing with the Perfect Shuffle
• Programmable finite automata for VLSI†
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Real-time language recognition by one-dimensional cellular automata
• Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
• Speed of Recognition of Context-Free Languages by Array Automata
• Systolic trellis automatat†

Cited in

(10)

• Synthesis, structure and power of systolic computations
• Variations of the firing squad problem and applications
• Fault-tolerant schemes for some systolic systems
• Foundations of a theory of synchronous systems
• An efficient solution of the firing mob problem
• An algebraic model of synchronous systems
• On totalistic systolic networks
• Computation theoretic aspects of cellular automata
• Synthesis and equivalence of concurrent systems
• Two-dimensional iterative arrays: Characterizations and applications

This page was built for publication: Topological transformations as a tool in the design of systolic networks

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