On the Size Complexity of Deterministic Frequency Automata
Austinat, Diekert, Hertrampf, and Petersen  proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ can be recognized by a deterministic finite automaton with no more than k states.
Austinat et al.  also proved that every language L over a single-letter alphabet that is (1,n)-recognizable by a deterministic frequency automaton can be recognized by a deterministic finite automaton. For languages over a single-letter alphabet we show that if a deterministic frequency automaton has k states and (1,n)-recognizes a language L then there is a language L′ approximating L such that L′ can be recognized by a deterministic finite automaton with no more that k states. However, there are approximations such that our bound is much higher, i.e., k!.
Unable to display preview. Download preview PDF.
- 5.Degtev, A.N.: On (m,n)-computable sets. In: Moldavanskij, D.I. (ed.) Algebraic Systems, pp. 88–99. Ivanovo Gos. Universitet (1981) (in Russian)Google Scholar
- 7.Freivalds, R.: On the growth of the number of states in result of the determinization of probabilistic finite automata. Avtomatika i Vychislitel’naya Tekhnika 3, 39–42 (1982) (in Russian)Google Scholar
- 10.Harizanov, V., Kummer, M., Owings, J.: Frequency computations and the cardinality theorem. The Journal of Symbolic Logic 57(2) (1992)Google Scholar
- 13.Kinber, E.B.: Frequency computations in finite automata. Cybernetics and Systems Analysis 12(2), 179–187 (1976)Google Scholar
- 18.Rose, G.F.: An extended notion of computability. In: International Congress for Logic, Methodology and Philosophy of Science, Stanford University, Stanford, California, August 24-September 2 (1960); Abstracts of contributed papersGoogle Scholar
- 20.Trakhtenbrot, B.A.: On the frequency computation of functions. Algebra i Logika 2(1), 25–32 (1964) (in Russian)Google Scholar