Skip to main content
Log in

Arithmetic Complexity, Kleene Closure, and Formal Power Series

Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

The aim of this paper is to use formal power series techniques to study the structure of small arithmetic complexity classes such as GapNC1 and GapL. More precisely, we apply the formal power series operations of inversion and root extraction to these complexity classes. We define a counting version of Kleene closure and show that it is intimately related to inversion and root extraction within GapNC1 and GapL. We prove that Kleene closure, inversion, and root extraction are all hard operations in the following sense: there is a language in AC0 for which inversion and root extraction are GapL-complete and Kleene closure is NLOG-complete, and there is a finite set for which inversion and root extraction are GapNC1 -complete and Kleene closure is NC1 -complete, with respect to appropriate reducibilities.

The latter result raises the question of classifying finite languages so that their inverses fall within interesting subclasses of GapNC1 , such as GapAC0 . We initiate work in this direction by classifying the complexity of the Kleene closure of finite languages. We formulate the problem in terms of finite monoids and relate its complexity to the internal structure of the monoid.

Some results in this paper show properties of complexity classes that are interesting independent of formal power series considerations, including some useful closure properties and complete problems for GapL.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Allender, E., Arvind, V. & Mahajan, M. Arithmetic Complexity, Kleene Closure, and Formal Power Series . Theory Comput. Systems 36, 303–328 (2003). https://doi.org/10.1007/s00224-003-1077-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-003-1077-7

Keywords

Navigation