Power of interconnections and of nondeterminism in regularY-tree systolic automata
From MaRDI portal
Publication:4835866
DOI10.1007/BF01303058zbMATH Open0827.68077MaRDI QIDQ4835866FDOQ4835866
Authors: Emanuela Fachini, Jozef Gruska, Margherita Napoli, Mimmo Parente 
Publication date: 13 December 1995
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Recommendations
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Systolic trellis automata: Stability, decidability and complexity
- Systolic trellis automatata †
- One-way bounded cellular automata
- Characterizations and computational complexity of systolic trellis automata
- Title not available (Why is that?)
- Systolic automata for VLSI on balanced trees
- A Kleene-like characterization of languages accepted by systolic tree automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a family of L languages resulting from systolic tree automata
- Synthesis, structure and power of systolic computations
- C-tree systolic automata
- Programmable finite automata for VLSI†
- Title not available (Why is that?)
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
- SYSTOLIC TREE WITH BASE AUTOMATA
Cited In (3)
This page was built for publication: Power of interconnections and of nondeterminism in regularY-tree systolic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835866)
