SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA

DOI10.1142/S0129054190000084zbMATH Open0726.68057OpenAlexW1992618581MaRDI QIDQ3348431FDOQ3348431

Authors: Emanuela Fachini, Jozef Gruska, Andrea Maggiolo-Schettini, Davide Sangiorgi 

Publication date: 1990

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054190000084

Recommendations

• scientific article; zbMATH DE number 4030987
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• C-tree systolic automata
• Systolic trellis automatat†
• Systolic trellis automata: Stability, decidability and complexity

zbMATH Keywords

modularityregularitytree automatatrellis automatasystolic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cited In (8)

• Synthesis, structure and power of systolic computations
• Characterizations and computational complexity of systolic trellis automata
• Systolic automata and P systems
• Systolic tree and tree-like automata
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348431)