Minimal automation for a factorial, transitive, and rational language
Theoretical Computer Science
Intersection and union of regular languages and state complexity
Information Processing Letters
Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Handbook of formal languages, vol. 1
Symbolic dynamics and finite automata
Handbook of formal languages, vol. 2
Linear cellular automata and Fischer automata
Parallel Computing - Special issue: cellular automata
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
SIAM Journal on Computing
Varieties Of Formal Languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Five Determinisation Algorithms
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Security fusion: a new security architecture for resource-constrained environments
HotSec'11 Proceedings of the 6th USENIX conference on Hot topics in security
| Hi-index | 0.00 |
We describe a class of simple transitive semiautomata that exhibit full exponential blowup 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.