Regex & automata
Regular expressions and finite-automaton behavior. As of 2026-10-18, the strongest model on this domain is OpenAI: GPT-5.5 (100% — 16 of 16 questions correct).
What this domain tests
Whether strings match a given regular expression / are accepted by a finite automaton, and related language-recognition reasoning — exact formal-language execution.
Why it resists contamination
The pattern, the test strings, and the ground-truth accept/reject labels are all generated together, so each instance is fresh and programmatically verifiable. Because instances are generated with a programmatic ground truth, this is a “generator-as-oracle” domain — effectively unlimited fresh, self-verifying items. See the full methodology.
Best AI models for Regex & automata
Primary sources & further reading
Frequently asked questions
What does the meo Regex & automata benchmark test?
Whether strings match a given regular expression / are accepted by a finite automaton, and related language-recognition reasoning — exact formal-language execution.
Why can't AI models game the Regex & automata benchmark?
The pattern, the test strings, and the ground-truth accept/reject labels are all generated together, so each instance is fresh and programmatically verifiable.
Which AI model is best at Regex & automata?
OpenAI: GPT-5.5 leads the Regex & automata domain on the meo benchmark with 100% accuracy (as of 2026-10-18).
Related: all domains · Regex & automata ranking · methodology · full leaderboard.