Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata

DOI10.1007/BF01185564zbMath0790.68086OpenAlexW1967603862MaRDI QIDQ1323376

Andrea Maggiolo-Schettini, Emanuela Fachini, Davide Sangiorgi

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01185564

zbMATH Keywords

parallel systemssystolic trellis automatasystolic systems\(Y\)-tree Automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (2)

Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ Systolic Automata and P Systems

Cites Work

• On a family of L languages resulting from systolic tree automata
• Synthesis, structure and power of systolic computations
• C-tree systolic automata
• Systolic automata for VLSI on balanced trees
• Systolic trellis automata: Stability, decidability and complexity
• SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
• Systolic trellis automatata †
• Power of interconnections and of nondeterminism in regularY-tree systolic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata