The Power of Programs over Monoids in J

1 VALDA - Value from Data
DI-ENS - Département d'informatique de l'École normale supérieure, Inria de Paris
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}$.
Document type :
Conference papers
Domain :

Cited literature [28 references]

https://hal.archives-ouvertes.fr/hal-02414771
Contributor : Nathan Grosshans <>
Submitted on : Tuesday, December 17, 2019 - 12:34:22 PM
Last modification on : Friday, January 10, 2020 - 10:38:24 AM

Files

Power_programs_over_J-Author_v...
Files produced by the author(s)

Identifiers

• HAL Id : hal-02414771, version 1
• ARXIV : 1912.07992

Citation

Nathan Grosshans. The Power of Programs over Monoids in J. 14th International Conference on Language and Automata Theory and Applications (LATA 2020), Mar 2020, Milan, Italy. ⟨hal-02414771⟩

Record views