Minimal automation for a factorial, transitive, and rational language
Theoretical Computer Science
On the limit set of some universal cellular automata
Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Symbolic dynamics and finite automata
Handbook of formal languages, vol. 2
Linear cellular automata and Fischer automata
Parallel Computing - Special issue: cellular automata
Varieties Of Formal Languages
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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.