no code implementations • 15 Feb 2021 • Antoine Amarilli, Louis Jachiet, Charles Paperman
We show that the problem is in O(log log |w|) for languages in an algebraically-defined, decidable class QSG, and that it is in O(1) for another such class QLZG.
Formal Languages and Automata Theory Data Structures and Algorithms
no code implementations • 15 Feb 2021 • Antoine Amarilli, Charles Paperman
We study the variety ZG of monoids where the elements that belong to a group are central, i. e., commute with all other elements.
Formal Languages and Automata Theory
