Document Open Access Logo

The Trichotomy of Regular Property Testing

Authors Gabriel Bathie , Nathanaël Fijalkow , Corto Mascle

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.141.pdf
  • Filesize: 0.92 MB
  • 21 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Regular languages
Keywords
  • property testing
  • regular languages

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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 yields effective characterizations for all three classes using so-called minimal blocking sequences, reasoning directly and combinatorially on automata.

Cite As Get BibTex

Gabriel Bathie, Nathanaël Fijalkow, and Corto Mascle. The Trichotomy of Regular Property Testing. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 141:1-141:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.141

Author Details

Gabriel Bathie
  • LaBRI, Université de Bordeaux, France
  • DIENS, Paris, France
Nathanaël Fijalkow
  • LaBRI, CNRS, Université de Bordeaux, France
Corto Mascle
  • LaBRI, Université de Bordeaux, France
  • MPI-SWS, Kaiserslautern, Germany

Funding

  • Bathie, Gabriel: Partially funded by the grant ANR-20-CE48-0001 from the French National Research Agency.

References

  1. Maryam Aliakbarpour, Ilias Diakonikolas, and Ronitt Rubinfeld. Differentially private identity and equivalence testing of discrete distributions. In International Conference on Machine Learning, ICML, 2018. URL: https://proceedings.mlr.press/v80/aliakbarpour18a.html.
  2. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, and Raphael Yuster. The algorithmic aspects of the regularity lemma. Journal of Algorithms, 16(1):80-109, 1994. URL: https://doi.org/10.1006/JAGM.1994.1005.
  3. Noga Alon, Eldar Fischer, Michael Krivelevich, and Mario Szegedy. Efficient testing of large graphs. Combinatorica, 20(4):451-476, 2000. URL: https://doi.org/10.1007/s004930070001.
  4. Noga Alon, Michael Krivelevich, Ilan Newman, and Mario Szegedy. Regular languages are testable with a constant number of queries. SIAM Journal on Computing, 30(6):1842-1862, 2001. URL: https://doi.org/10.1109/SFFCS.1999.814641.
  5. Noga Alon and Asaf Shapira. Every monotone graph property is testable. SIAM Journal of Computing, 38(2):505-522, 2008. URL: https://doi.org/10.1137/050633445.
  6. Antoine Amarilli, Louis Jachiet, and Charles Paperman. Dynamic membership for regular languages. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198 of LIPIcs, pages 116:1-116:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.ICALP.2021.116.
  7. Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, and Girish Varma. Streaming algorithms for language recognition problems. Theoretical Computer Science, 494:13-23, 2013. URL: https://doi.org/10.1016/J.TCS.2012.12.028.
  8. Gabriel Bathie and Tatiana Starikovskaya. Property testing of regular languages with applications to streaming property testing of visibly pushdown languages. In International Colloquium on Automata, Languages, and Programming, ICALP, 2021. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.119.
  9. Manuel Blum, Michael Luby, and Ronitt Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993. URL: https://doi.org/10.1016/0022-0000(93)90044-W.
  10. Ilias Diakonikolas and Daniel M Kane. A new approach for testing properties of discrete distributions. In IEEE Symposium on Foundations of Computer Science, FOCS, pages 685-694. IEEE, 2016. URL: https://doi.org/10.1109/FOCS.2016.78.
  11. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, and Alex Samorodnitsky. Improved testing algorithms for monotonicity. In International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM, pages 97-108. Springer, 1999. URL: https://doi.org/10.1007/978-3-540-48413-4_10.
  12. Funda Ergün, Sampath Kannan, S.Ravi Kumar, Ronitt Rubinfeld, and Mahesh Viswanathan. Spot-checkers. Journal of Computer and System Sciences, 60(3):717-751, 2000. URL: https://doi.org/10.1006/jcss.1999.1692.
  13. Eldar Fischer, Frédéric Magniez, and Tatiana Starikovskaya. Improved bounds for testing Dyck languages. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1529-1544. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.100.
  14. Nathanaël François, Frédéric Magniez, Michel de Rougemont, and Olivier Serre. Streaming property testing of visibly pushdown languages. In Proceedings of the 24th Annual European Symposium on Algorithms, volume 57 of LIPIcs, pages 43:1-43:17, 2016. URL: https://doi.org/10.4230/LIPIcs.ESA.2016.43.
  15. Moses Ganardi, Danny Hucke, and Markus Lohrey. Randomized sliding window algorithms for regular languages. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, volume 107 of LIPIcs, pages 127:1-127:13, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.127.
  16. Moses Ganardi, Danny Hucke, Markus Lohrey, and Tatiana Starikovskaya. Sliding Window Property Testing for Regular Languages. In Pinyan Lu and Guochuan Zhang, editors, 30th International Symposium on Algorithms and Computation (ISAAC 2019), volume 149 of Leibniz International Proceedings in Informatics (LIPIcs), pages 6:1-6:13, Dagstuhl, Germany, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2019.6.
  17. Oded Goldreich. Introduction to property testing. Cambridge University Press, 2017. URL: https://doi.org/10.1017/9781108135252.
  18. Oded Goldreich, Shari Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, July 1998. URL: https://doi.org/10.1145/285055.285060.
  19. Rahul Jain and Ashwin Nayak. The space complexity of recognizing well-parenthesized expressions in the streaming model: The index function revisited. IEEE Transactions on Information Theory, 60(10):6646-6668, October 2014. URL: https://doi.org/10.1109/TIT.2014.2339859.
  20. Andreas Krebs, Nutan Limaye, and Srikanth Srinivasan. Streaming algorithms for recognizing nearly well-parenthesized expressions. In Proc. of MFCS 2011, volume 6907 of LNCS, pages 412-423. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-22993-0_38.
  21. Frédéric Magniez and Michel de Rougemont. Property testing of regular tree languages. Algorithmica, 49(2):127-146, 2007. URL: https://doi.org/10.1007/s00453-007-9028-3.
  22. Frédéric Magniez, Claire Mathieu, and Ashwin Nayak. Recognizing well-parenthesized expressions in the streaming model. SIAM J. Comput., 43(6):1880-1905, 2014. URL: https://doi.org/10.1137/130926122.
  23. Liam Paninski. A coincidence-based test for uniformity given very sparsely sampled discrete data. IEEE Transactions on Information Theory, 54(10):4750-4755, 2008. URL: https://doi.org/10.1109/TIT.2008.928987.
  24. Michal Parnas, Dana Ron, and Ronitt Rubinfeld. Testing membership in parenthesis languages. Random Struct. Algorithms, 22(1):98-138, 2003. URL: https://doi.org/10.1002/rsa.10067.
  25. Jean-Éric Pin, editor. Handbook of Automata Theory. European Mathematical Society Publishing House, Zürich, Switzerland, 2021. URL: https://doi.org/10.4171/AUTOMATA.
  26. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996. URL: https://doi.org/10.1137/S0097539793255151.
  27. Mosaad Al Thokair, Minjian Zhang, Umang Mathur, and Mahesh Viswanathan. Dynamic race detection with O(1) samples. Proc. ACM Program. Lang., 7(POPL):1308-1337, 2023. URL: https://doi.org/10.1145/3571238.
  28. Andrew Chi-Chin Yao. Probabilistic computations: Toward a unified measure of complexity. In Symposium on Foundations of Computer Science, SFCS, pages 222-227. IEEE, 1977. URL: https://doi.org/10.1109/SFCS.1977.24.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact