collaborators

1 paper

cs.CC2002

On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata

Maxim Makatchev

This paper studies complexity of recognition of classes of bounded configurations by a generalization of conventional cellular automata (CA) -- finite dynamic cellular automata (FD…