SYSTOLIC TREE WITH BASE AUTOMATA

DOI10.1142/S0129054191000145MaRDI QIDQ4007853zbMATH OpenOpenAlexFDO

Authors Angelo Monti, Mimmo Parente

Publication date 27 September 1992

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

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

zbMATH Keywords

decidabilitysimulationstabilitysystolic systemssystolic tree automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 4126708
• scientific article; zbMATH DE number 3911718
• scientific article; zbMATH DE number 4215381
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• Systolic trellis automatat†

Cited in

(7)

• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• Succinctness of descriptions of SBTA-languages
• scientific article; zbMATH DE number 3911718 (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?)
• Power of interconnections and of nondeterminism in regularY-tree systolic automata
• State complexity of SBTA languages

This page was built for publication: SYSTOLIC TREE WITH BASE AUTOMATA

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