On Some Open Problems in the Theory of Cellular Automata

DOI10.1109/T-C.1974.223995MaRDI QIDQ4772714zbMATH OpenFDO

Authors S. R. Kosaraju

Publication date 1974

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1974.223995

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Cited in

(17)

• Two-dimensional iterative arrays: Characterizations and applications
• Relating the power of cellular arrays to their closure properties
• Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
• On iterative and cellular tree arrays
• Recognition of topological equivalence of patterns by array automata
• Pushdown cellular automata
• Two-dimensional cellular automata and their neighborhoods
• A survey of two-dimensional automata theory
• scientific article; zbMATH DE number 3872685 (Why is no real title available?)
• Statistical mechanics of cellular automata
• On the computational power of totalistic cellular automata
• Fault-tolerant schemes for some systolic systems
• The notion of a probabilistic cellular acceptor
• Some results on time-varying and relativised cellular automata^*
• PROCESSES AND THEIR INTERACTIONS
• On time reduction and simulation in cellular spaces
• On some open problems concerning the complexity of cellular arrays

This page was built for publication: On Some Open Problems in the Theory of Cellular Automata

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