Research4h ago
Transformers Outperform Finite Automata In Expressive Power
A new proof demonstrates that Transformers represent formal languages more succinctly than finite automata or Linear Temporal Logic formulas. This high expressive power comes with a cost. Verifying transformer properties is now proven to be EXPSPACE-complete. This result confirms that formal verification of these models is computationally intractable for practitioners.