1. Austinat, H., Diekert, V., Hertrampf, U.: A structural property of regular frequency computations. Theoretical Comput. Sci. 292(1), 33–43 (2003)
2. Austinat, H., Diekert, V., Hertrampf, U., Petersen, H.: Regular frequency computations. In: Proc. RIMS Symposium on Algebraic Systems, Formal Languages and Computation. Research Inst. for Mathematical Sci., Kyoto Univ., Japan. RIMS Kokyuroku, vol. 1166, pp. 35–42 (2000)
3. Beigel, R.: Query-Limited Reducibilities. PhD thesis, Stanford Univ., USA (1987)
4. Beigel, R., Gasarch, W.I., Kummer, M., Martin, G., McNicholl, T., Stephan, F.: The complexity of $ODD^{A}_{n}$ . J. Symbolic Logic 65(1), 1–18 (2000)
5. Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proc. 1960 International Congress on Logic, Methodology and Philosophy of Sci., pp. 1–11. Stanford Univ. Press, Stanford (1962)