Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T09:04:48.309Z Has data issue: false hasContentIssue false

Finite automata, real time processes and counting problems in bounded arithmetics

Published online by Cambridge University Press:  12 March 2014

Mirosław Kutyłowski*
Affiliation:
Computer Science Institute, University of Wrocław, 51-151 Wrocław, Poland

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable