Research2h ago
Transformers Outperform Finite Automata In Expressive Power
Transformers represent formal languages more succinctly than finite automata or Linear Temporal Logic formulas. This high expressive power creates a critical trade-off. Researchers prove that verifying transformer properties is EXPSPACE-complete, making formal verification provably intractable. Practitioners cannot rely on automated proofs to guarantee model behavior in complex formal systems.