The size of power automata

K. Sutner
2003 Theoretical Computer Science  
We describe a class of simple transitive semiautomata that exhibit full exponential blow-up during deterministic simulation. For arbitrary semiautomata we show that it is PSPACE-complete to decide whether the size of the accessible part of their power automata exceeds a given bound. We comment on the application of these results to the study of cellular automata.
doi:10.1016/s0304-3975(02)00413-9 fatcat:j355w5x5fvbcjdfew2y6gcjhsy