Dynamic Membership for Regular Languages

02/15/2021
by   Antoine Amarilli, et al.
0

We study the dynamic membership problem for regular languages: fix a language L, read a word w, build in time O(|w|) a data structure indicating if w is in L, and maintain this structure efficiently under substitution edits on w. We consider this problem on the unit cost RAM model with logarithmic world length, where the problem always has a solution in O(log |w| / log log |w|). We show that the problem is in O(log log |w|) for languages in an algebraically-defined class QSG, and that it is in O(1) for another class QLZG. We show that languages not in QSG admit a reduction from the prefix problem for a cyclic group, so that they require Ω(log n/ log log n) operations in the worst case; and that QSG languages not in QLZG admit a reduction from the prefix problem for the monoid U_1, which we conjecture cannot be maintained in O(1). This yields a conditional trichotomy. We also investigate intermediate cases between O(1) and O(log log n). Our results are shown via the dynamic word problem for monoids and semigroups, for which we also give a classification. We thus solve open problems of the paper of Skovbjerg Frandsen, Miltersen, and Skyum on the dynamic word problem, and additionally cover regular languages.

READ FULL TEXT
research
06/28/2021

Dynamic Connectivity in Disk Graphs

Let S be a set of n sites, each associated with a point in ℝ^2 and a rad...
research
09/29/2022

Low-Latency Sliding Window Algorithms for Formal Languages

Low-latency sliding window algorithms for regular and context-free langu...
research
01/06/2022

Decision trees for regular factorial languages

In this paper, we study arbitrary regular factorial languages over a fin...
research
04/09/2022

Reduction ratio of the IS-algorithm: worst and random cases

We study the IS-algorithm, a well-known linear-time algorithm for comput...
research
09/24/2019

Dynamic Complexity of Document Spanners

The present paper investigates the dynamic complexity of document spanne...
research
12/17/2019

The Power of Programs over Monoids in J

The model of programs over (finite) monoids, introduced by Barrington an...
research
02/08/2022

The amazing mixed polynomial closure and its applications to two-variable first-order logic

Polynomial closure is a standard operator which is applied to a class of...

Please sign up or login with your details

Forgot password? Click here to reset