|
Problemy Peredachi Informatsii, 2013, Volume 49, Issue 2, Pages 58–72
(Mi ppi2108)
|
|
|
|
Automata Theory
Determinization of ordinal automata
An. A. Muchnik
Abstract:
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.
Received: 05.09.2011 Revised: 05.02.2013
Citation:
An. A. Muchnik, “Determinization of ordinal automata”, Probl. Peredachi Inf., 49:2 (2013), 58–72; Problems Inform. Transmission, 49:2 (2013), 149–162
Linking options:
https://www.mathnet.ru/eng/ppi2108 https://www.mathnet.ru/eng/ppi/v49/i2/p58
|
Statistics & downloads: |
Abstract page: | 255 | Full-text PDF : | 70 | References: | 36 | First page: | 15 |
|