Synthesis, structure and power of systolic computations
From MaRDI portal
Publication:913515
DOI10.1016/0304-3975(90)90190-SzbMath0699.68080MaRDI QIDQ913515
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (9)
A Kleene-like characterization of languages accepted by systolic tree automata ⋮ Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ State complexity of SBTA languages ⋮ Succinctness of descriptions of SBTA-languages ⋮ Completeness results concerning systolic tree automata and E0L languages ⋮ Definability and decidability of binary predicates for time granularity ⋮ Systolic tree \(\omega\)-languages: The operational and the logical view ⋮ Languages accepted by systolic \(Y\)-tree automata: Structural characterizations ⋮ Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On real-time cellular automata and trellis automata
- Characterizations and computational complexity of systolic trellis automata
- Iterative tree automata
- On a family of L languages resulting from systolic tree automata
- Spacetime representations of computational structures
- A characterization of systolic binary tree automata and applications
- Topological transformations as a tool in the design of systolic networks
- Computation theory of cellular automata
- Real-time, pseudo real-time, and linear-time ITA
- Two-dimensional iterative arrays: Characterizations and applications
- C-tree systolic automata
- On totalistic systolic networks
- An equational axiomatization of systolic systems
- Systolic automata for VLSI on balanced trees
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
- Systolic trellis automata: Stability, decidability and complexity
- Programmable finite automata for VLSI†
- Wafer-Scale Integration of Systolic Arrays
- SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
- Statistical mechanics of cellular automata
- Systolic trellis automatat†
- The Design of Optimal Systolic Arrays
- Syntactic monoids in the construction of systolic tree automata
- Proving systolic systems correct
- Parallel Parsing on a One-Way Array of Finite-State Machines
- On One-Way Cellular Arrays
- Iterative tree arrays with logarithmic depth†
This page was built for publication: Synthesis, structure and power of systolic computations
