Power of interconnections and of nondeterminism in regularY-tree systolic automata

DOI10.1007/BF01303058zbMath0827.68077MaRDI QIDQ4835866

Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente

Publication date: 13 December 1995

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

systolic automataregular \(Y\)-trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

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
• Characterizations and computational complexity of systolic trellis automata
• 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
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• A Kleene-like characterization of languages accepted by systolic tree automata
• Systolic trellis automata: Stability, decidability and complexity
• Programmable finite automata for VLSI†
• Systolic trellis automatata †
• One-way bounded cellular automata
• SYSTOLIC TREE WITH BASE AUTOMATA

This page was built for publication: Power of interconnections and of nondeterminism in regularY-tree systolic automata