Pages that link to "Item:Q913515"
From MaRDI portal
The following pages link to Synthesis, structure and power of systolic computations (Q913515):
Displaying 18 items.
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
- Formal analysis of a systolic system for finite element stiffness matrices (Q1064789) (← links)
- On totalistic systolic networks (Q1108796) (← links)
- Trends in systolic and cellular computation (Q1184130) (← links)
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations (Q1323359) (← links)
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata (Q1323376) (← links)
- A Kleene-like characterization of languages accepted by systolic tree automata (Q1333404) (← links)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
- Systolic tree \(\omega\)-languages: The operational and the logical view (Q1575949) (← links)
- The application of a sequence notation to the design of systolic computations (Q1822920) (← links)
- Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays (Q1823660) (← links)
- Solving some combinatorial problems on arrays with one-way dataflow (Q1825042) (← links)
- Definability and decidability of binary predicates for time granularity (Q2495389) (← links)
- (Q4696135) (← links)
- (Q4728216) (← links)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata (Q4835866) (← links)
- State complexity of SBTA languages (Q5096343) (← links)
- Parallel Processing and Applied Mathematics (Q5307398) (← links)