Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
From MaRDI portal
Publication:1323376
DOI10.1007/BF01185564zbMath0790.68086MaRDI QIDQ1323376
Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
Publication date: 10 May 1994
Published in: Acta Informatica (Search for Journal in Brave)
68Q80: Cellular automata (computational aspects)
Related Items
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