Article contents
Finite automata, real time processes and counting problems in bounded arithmetics
Published online by Cambridge University Press: 12 March 2014
Abstract
In this paper we present a negative solution of counting problems for some classes slightly different from bounded arithmetic (Δ 0sets). To get the results we study properties of chains of finite automata.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1988
References
REFERENCES
[1]
Eilenberg, S., Automata, languages, and machines, vol. B, Academic Press, New York, 1976.Google Scholar
[2]
Krohn, K. and Rhodes, J., Algebraic theory of machines, I: Prime decomposition theorem for finite semigroups and machines, Transactions of the American Mathematical Society, vol. 116 (1965), pp. 450–464.Google Scholar
[3]
Paris, J., Handley, W., and Wilkie, A., Characterizing some low arithmetic classes, manuscript (received by me in 03
1985).Google Scholar
[4]
Paris, J. and Wilkie, A., Counting problems in bounded arithmetic, Methods in mathematical logic (
proceedings, Caracas, 1983
; Di Prisco, C. A., editor), Lecture Notes in Mathematics, vol. 1130, Springer-Verlag, Berlin, 1985, pp. 317–340.CrossRefGoogle Scholar
- 2
- Cited by