Can someone give me examples of quantifiers that can't be solved with FSA (like all, any, at least x, etc.), i.e can't be defined in first-order logic, but require a PDA to determine? I know "most" is one, but I couldn't come up with any other examples.
Thanks in advance!
Best regards.