RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems

Documenti analoghi

• Locality Testing for NFAs is PSPACE-complete
  di: Amarilli, Antoine, et al.
  Pubblicazione: (2025)
• Linear Time Subsequence and Supersequence Regex Matching
  di: Amarilli, Antoine, et al.
  Pubblicazione: (2025)
• The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
  di: Daviaud, Laure, et al.
  Pubblicazione: (2023)
• Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
  di: Havlena, Vojtěch, et al.
  Pubblicazione: (2022)
• Mechanics of Learned Reasoning 1: TempoBench, A Benchmark for Interpretable Deconstruction of Reasoning System Performance
  di: Holzer, Nikolaus, et al.
  Pubblicazione: (2025)