The Power of Programs over Monoids in J - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

The Power of Programs over Monoids in J

(1, 2)
1
2

Abstract

The model of programs over (finite) monoids, introduced by Barrington and Thérien, 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}$. We show that those programs actually can recognise all languages from a class of restricted dot-depth one languages, using a non-trivial trick, and conjecture that this class suffices to characterise the regular languages recognised by programs over monoids in $\mathbf{J}$.
Fichier principal
Vignette du fichier
Power_programs_over_J-Author_version.pdf (373.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02414771 , version 1 (17-12-2019)

Identifiers

Cite

Nathan Grosshans. The Power of Programs over Monoids in J. LATA 2020 - 14th International Conference on Language and Automata Theory and Applications, Mar 2020, Milan, Italy. pp.315-327, ⟨10.1007/978-3-030-40608-0_22⟩. ⟨hal-02414771⟩
119 View
82 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More