Systolic automata for VLSI on balanced trees
From MaRDI portal
Publication:1168737
DOI10.1007/BF00289573zbMath0493.68054OpenAlexW2030683793MaRDI QIDQ1168737
Karel II Culik, Jozef Gruska, Arto Salomaa
Publication date: 1983
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289573
Related Items (24)
A Kleene-like characterization of languages accepted by systolic tree automata ⋮ Syntactic monoids in the construction of systolic tree automata ⋮ Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ C-tree systolic automata ⋮ Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ Systolic Automata and P Systems ⋮ State complexity of SBTA languages ⋮ Superposable Trellis Automata ⋮ Succinctness of descriptions of SBTA-languages ⋮ Synthesis, structure and power of systolic computations ⋮ Systolic trees and systolic language recognition by tree automata ⋮ The complexity of systolic dissemination of information in interconnection networks ⋮ Completeness results concerning systolic tree automata and E0L languages ⋮ Programmable finite automata for VLSI† ⋮ Unnamed Item ⋮ Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata ⋮ Characterizations and computational complexity of systolic trellis automata ⋮ A characterization of systolic binary tree automata and applications ⋮ Iterative tree automata ⋮ On a family of L languages resulting from systolic tree automata ⋮ Systolic trellis automatata † ⋮ Systolic trellis automatat† ⋮ Languages accepted by systolic \(Y\)-tree automata: Structural characterizations ⋮ Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
Cites Work
This page was built for publication: Systolic automata for VLSI on balanced trees
