4 ms·

What a nice CAPTCHA!

• jonhohle 3y ago
  To prove that you are a Turing machine.
  • schoen 3y ago
    Regular expressions (in the original computer science sense) can be matched by finite-state automata!
    • lemoing 3y ago
      Yes, but filling a grid in a way that satisfies all of the regular expressions is a much harder problem than matching a single regex. Semi-related: generating fill for regular crosswords is NP-complete: https://www.sciencedirect.com/science/article/abs/pii/S0304397523005881 https://www.sciencedirect.com/science/article/abs/pii/S03043...
      • mcint 3y ago
        Well, at this scale, it would take longer to set up a SAT solver than it would for the SAT solver to list all valid solutions.