Finite automata and unary languages
Theoretical Computer Science
Descriptional complexity of deterministic finite automata with multiple initial states
Journal of Automata, Languages and Combinatorics
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
On the state complexity of k-entry deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Nondeterministic Communication with a Limited Number of Advice Bits
SIAM Journal on Computing
Complementing unary nondeterministic automata
Theoretical Computer Science - Descriptional complexity of formal systems
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Finite automata and their decision problems
IBM Journal of Research and Development
Nondeterministic Moore automata and Brzozowski's algorithm
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Reversal of binary regular languages
Theoretical Computer Science
Nondeterministic Moore automata and Brzozowski's minimization algorithm
Theoretical Computer Science
Hi-index | 0.00 |
Self-verifying automata are a special variant of finite automata with a symmetric kind of nondeterminism. We study the conversion of self-verifying automata to deterministic automata from a descriptional complexity point of view. The main result is the exact cost, in terms of the number of states, of such a simulation.