Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1912.07992

The Power of Programs over Monoids in J and Threshold Dot-depth One Languages

Nathan Grosshans
View original source ↗Read source document ↗Export metadata ↓

Abstract

The model of programs over (finite) monoids, introduced by Barrington and Th\'erien, gives an interesting way to characterise the circuit complexity class $\mathsf{NC^1}$ and its subclasses and showcases deep connections with algebraic automata theory. In this article, we investigate the computational power of programs over monoids in $\mathbf{J}$, a small variety of finite aperiodic monoids. First, we give a fine hierarchy within the class of languages recognised by programs over monoids from $\mathbf{J}$, based on the length of programs but also some parametrisation of $\mathbf{J}$. Second, and most importantly, we make progress in understanding what regular languages can be recognised by programs over monoids in $\mathbf{J}$. To this end, we introduce a new class of restricted dot-depth one languages, threshold dot-depth one languages. We show that programs over monoids in $\mathbf{J}$ actually can recognise all languages from this class, using a non-trivial trick, and conjecture that threshold dot-depth one languages with additional positional modular counting suffice to characterise the regular languages recognised by programs over monoids in $\mathbf{J}$. Finally, using a result by J. C. Costa, we give an algebraic characterisation of threshold dot-depth one languages that supports that conjecture and is of independent interest.

Explore related subjects

cs.CCcs.FL

Keep this discovery

BibTeXRIS

Nathan Grosshans. 2019-12-17. The Power of Programs over Monoids in J and Threshold Dot-depth One Languages. https://arxiv.org/abs/1912.07992

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗