2000 character limit reached
Von Neumann regularity, split epicness and elementary cellular automata
Published 11 Apr 2018 in cs.FL, math.DS, and nlin.CG | (1804.03913v3)
Abstract: We show that a cellular automaton on a mixing subshift of finite type is a Von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic shifts and block maps. It follows from [S.-T\"orm\"a, 2015] that Von Neumann regularity is decidable condition, and we decide it for all elementary CA.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.