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