Triangle cellular automata

DOI10.1016/S0019-9958(81)90598-2MaRDI QIDQ3910005zbMATH OpenFDO

Authors Charles R. Dyer, Azriel Rosenfeld

Publication date 1981

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(81)90598-2

zbMATH Keywords

language acceptance

Mathematics Subject Classification ID

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

Cited in

(9)

• Optimal simulation of tree arrays by linear arrays
• On iterative and cellular tree arrays
• Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
• Parallel computation of discrete Voronoi diagrams (extended abstract)
• On some open problems concerning the complexity of cellular arrays
• A survey of two-dimensional automata theory
• Iterative tree automata
• scientific article; zbMATH DE number 3911718 (Why is no real title available?)
• Parallel computation of distance transforms

This page was built for publication: Triangle cellular automata

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