Topological transformations as a tool in the design of systolic networks
DOI10.1016/0304-3975(85)90091-XzbMATH Open0584.68068OpenAlexW1978546206MaRDI QIDQ1069704FDOQ1069704
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
simulationequivalenceisomorphismparallel processingcomputational networkspace-time diagramsunrollings
Planar graphs; geometric and topological aspects of graph theory (05C10) Cellular automata (computational aspects) (68Q80) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Processing with the Perfect Shuffle
- One-way bounded cellular automata
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- Real-time language recognition by one-dimensional cellular automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- On real-time cellular automata and trellis automata
- Systolic trellis automatat†
- A characterization of systolic binary tree automata and applications
- Speed of Recognition of Context-Free Languages by Array Automata
- Folding of the plane and the design of systolic arrays
- Iterative tree automata
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- Programmable finite automata for VLSI†
- Iterative arrays with direct central control
Cited In (10)
- Synthesis, structure and power of systolic computations
- Synthesis and equivalence of concurrent systems
- Variations of the firing squad problem and applications
- Two-dimensional iterative arrays: Characterizations and applications
- Foundations of a theory of synchronous systems
- Fault-tolerant schemes for some systolic systems
- An efficient solution of the firing mob problem
- An algebraic model of synchronous systems
- Computation theoretic aspects of cellular automata
- On totalistic systolic networks
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)
