[1] S. C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies, 34, 3–41, (1956).
[2] M. Giger and P. Maertens, An empirical study of the understandability of regular expressions, Proceedings of the 2017 ACM SIGCHI Conference on Human Factors in Computing Systems, 2761–2772, (2017).
[3] A. Cooper and R. Fuller, Understanding the challenges of regular expressions: A developer’s perspective, Proceedings of the ACM International Conference on Computing Frontiers, 1–8, (2018).
[4] P. F. Wu, X. Huang, J. Ma, and T. Li, Empirical studies on developers’ use of regular expressions, Proceedings of the 11th ACM/IEEE International Conference on Software Engineering Aspects of Cloud Computing, 1–10, (2016).
[5] K. Serebryany, D. Lavrov, and D. D’Souza, Understanding and debugging regular expressions, Proceedings of the 2014 ACM International Conference on Software Engineering, 346–357, (2014).
[6] E. R. Holley and R. W. Scherrer, RegexBuddy: A tool for regular expression development and analysis, ACM SIGPLAN Notices, 47(11), 101–106, (2012).
[7] M. Sipser, Introduction to the Theory of Computation, Cengage Learning, (2012).
[8] M. Statt and B. Murphy, An empirical study of static analysis tool usage in industry, Proceedings of the 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering, 331–342, (2015).
[9] H. Bell, Mastering Regular Expressions, O’Reilly Media, (2013).
[10] J. Vitek and Y. Ryzhyk, A survey of tools for regular expression testing and debugging, ACM Computing Surveys, 51(3), 1–34, (2018).
[11] N. D. Jones, H. W. Schmidt, and A. Seth, The practical application of regular expressions, Springer Science & Business Media, (2001).
[12] S. H. Tabasi, S. Ghorbani, and A. Mohammadi Motlagh, A comparative study of IDEs for software development: Usability and feature analysis, International Journal of Computer Science and Engineering, 10(4), 1–12, (2022).