Automata, Languages, and Machines
Automata, Languages, and Machines
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
An Eilenberg Theorem for Words on Countable Ordinals
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Infinite sequences and finite machines
SWCT '63 Proceedings of the 1963 Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design
Finite automata and their decision problems
IBM Journal of Research and Development
Theories of automata on ω-tapes: A simplified approach
Journal of Computer and System Sciences
| Hi-index | 0.00 |
It is proved that for each nondeterministic ordinal automaton there exists a deterministic ordinal automaton which is equivalent to the original one for all countable ordinals. An upper bound for the number of states of the deterministic automaton is double exponential in the number of states of the nondeterministic automaton.