Metraipolis › archive › dc_365d22d607aa

A Circuit Complexity Trichotomy For Regular Languages — arXiv:2611.03615

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03615
License (as archived)
CC0-1.0
Archived
2026-11-03T11:46:33.964Z
SHA-256 of the archived text
814af57b2c2febed9190897a2be9a59288e275142797eb55b34b1151f35525c5
Stable URL of this page
https://metraipolis.com/documento/dc_365d22d607aa

How to cite

A Circuit Complexity Trichotomy For Regular Languages — arXiv:2611.03615 — arXiv (en), https://arxiv.org/abs/2611.03615 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_365d22d607aa (Metraipolis archive dc_365d22d607aa, sha256 814af57b2c2febed9190897a2be9a59288e275142797eb55b34b1151f35525c5)
BibTeX
@misc{dc365d22d607aa,
  title = {A Circuit Complexity Trichotomy For Regular Languages — arXiv:2611.03615},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03615},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_365d22d607aa; sha256 814af57b2c2febed9190897a2be9a59288e275142797eb55b34b1151f35525c5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03615. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We establish a trichotomy for the non-uniform, unbounded-fan-in circuit complexity of regular languages: the complexity of every regular language lies in exactly one of $O(1)$, $\Omega(\log n)\cap O(\log n\log\log n)$, or $\Omega(n)\cap O(n)$. Our main technical contribution is a characterization of the sublinear class in terms of algebra, word congruences, regular expressions, and logic. This class consists precisely of the regular languages computable by constant-depth circuits of size $O(\log^2 n)$, or, equivalently, by circuits of size $O(\log n\log\log n)$ and depth $O((\log\log n)^2)$. Consequently, every regular language of sublinear circuit complexity is definable in $\mathrm{FO}^2[\Sigma,<,\mathrm{mod}]$, which is contained in wire-linear $\mathbf{AC}^0$. For each of the three classes, deciding membership is $\mathbf{PSPACE}$-complete when the language is specified by a nondeterministic finite automaton. We also obtain a corresponding classification for regular languages with a neutral letter.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.CC, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC) ; Formal Languages and Automata Theory (cs.FL).
Pagina del lavoro: https://arxiv.org/abs/2611.03615 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:08:22.231Z dalla pagina https://arxiv.org/list/cs.CC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).