Finite Automata, Real Time Processes and Counting Problems in Bounded Arithmetics

Kutylowski, Miroslaw

J. Symbolic Logic, Tome 53 (1988) no. 1, p. 243-258 / Harvested from Project Euclid

Résumé

In this paper we present a negative solution of counting problems for some classes slightly different from bounded arithmetic ($\triangle_0$ sets). To get the results we study properties of chains of finite automata.

Publié le : 1988-03-14
Classification:

@article{1183742579,
     author = {Kutylowski, Miroslaw},
     title = {Finite Automata, Real Time Processes and Counting Problems in Bounded Arithmetics},
     journal = {J. Symbolic Logic},
     volume = {53},
     number = {1},
     year = {1988},
     pages = { 243-258},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742579}
}

Kutylowski, Miroslaw. Finite Automata, Real Time Processes and Counting Problems in Bounded Arithmetics. J. Symbolic Logic, Tome 53 (1988) no. 1, pp.  243-258. http://gdmltest.u-ga.fr/item/1183742579/