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

DOI10.1007/BF01303058MaRDI QIDQ4835866zbMATH OpenFDO

Authors Emanuela Fachini, Jozef Gruska, Margherita Napoli, Mimmo 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)

Recommendations

• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• Systolic tree and tree-like automata
• scientific article; zbMATH DE number 1023021
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• scientific article; zbMATH DE number 4126708

Cites work

• scientific article; zbMATH DE number 3911718 (Why is no real title available?)
• scientific article; zbMATH DE number 4047120 (Why is no real title available?)
• scientific article; zbMATH DE number 4108159 (Why is no real title available?)
• scientific article; zbMATH DE number 4126708 (Why is no real title available?)
• A Kleene-like characterization of languages accepted by systolic tree automata
• C-tree systolic automata
• Characterizations and computational complexity of systolic trellis automata
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• On a family of L languages resulting from systolic tree automata
• One-way bounded cellular automata
• Programmable finite automata for VLSI†
• SYSTOLIC TREE WITH BASE AUTOMATA
• Synthesis, structure and power of systolic computations
• Systolic automata for VLSI on balanced trees
• Systolic trellis automata: Stability, decidability and complexity
• Systolic trellis automatata †

Cited in

(3)

• scientific article; zbMATH DE number 4215381 (Why is no real title available?)
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations

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)