Finite automata, real time processes and counting problems in bounded arithmetics
Mirosław Kutyłowski · Journal of Symbolic Logic · 1988
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.