arXiv:2504.19152 · v2

The Trichotomy of Regular Property Testing

首次提交 2025-04-27 16:09

版本更新 2026-11-07 06:22

雷达观测 2026-11-10 11:14

摘要

Property testing is concerned with the design of algorithms making a sublinear number of queries to distinguish whether the input satisfies a given property or is far from having this property. A seminal paper of Alon, Krivelevich, Newman, and Szegedy in 2001 introduced property testing of formal languages: the goal is to determine whether an input word belongs to a given language, or is far from any word in that language. They constructed the first property testing algorithm for the class of all regular languages. This opened a line of work with improved complexity results and applications to streaming algorithms. In this work, we show a trichotomy result: the class of regular languages can be divided into three classes, each associated with an optimal query complexity. Our analysis, which reasons directly and combinatorially on automata, yields effective characterizations of all three classes using so-called minimal blocking sequences.

作者备注：Full version of the ICALP 2025 paper, revised for Logical Methods in Computer Science. 52 pages