Transformers are Inherently Succinct

Studies how compactly Transformers represent formal languages. The proofs compare their representation size with automata and temporal logic, while exposing the computational difficulty of model verification.

Studies how compactly Transformers represent formal languages. The proofs compare their representation size with automata and temporal logic, while exposing the computational difficulty of model verification.

When reading the original paper, identify its problem, inputs, outputs, and methodological assumptions.

Studies how compactly Transformers represent formal languages. The proofs compare their representation size with automata and temporal logic, while exposing the computational difficulty of model verification.

Check the baselines, datasets, evaluation protocol, and ablations in the original paper. This directory overview does not provide an independent evaluation or experimental results table.