Computations on nondeterministic cellular automata

DOI10.1006/inco.1998.2741zbMath0924.68146arXivcomp-gas/9801001OpenAlexW2089455133MaRDI QIDQ1283823

Yuri Ozhigov

Publication date: 30 March 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/comp-gas/9801001

zbMATH Keywords

nondeterministic cellular automatadeterministic cellular automata

Mathematics Subject Classification ID

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

Related Items (4)

A logical approach to locality in pictures languages ⋮ Topological dynamics of nondeterministic cellular automata ⋮ Nondeterministic cellular automata ⋮ Non-deterministic cellular automata and languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The constructibility of a configuration in a cellular automaton
• Computation theory of cellular automata
• Linear cellular automata and the garden-of-eden
• The complexity of theorem-proving procedures

This page was built for publication: Computations on nondeterministic cellular automata