1 citations · 2 across the 10 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2026
A Compositional Theory of Causally Masked Transformers
Franz Nowak, Ryan Cotterell, Reda Boumasmoud
What types of decision problems can a causally masked, finite-precision transformer solve for inputs of arbitrary length? Existing answers often rely on idealized arithmetic, but u…
cs.FL2026
An Algebraic View of the Expressivity of Recurrent Language Models
Franz Nowak, Ryan Cotterell, Reda Boumasmoud
What formal languages can a recurrent neural language model recognize? Formal results in the literature conflict: some authors report Turing-completeness, while others show equival…
cs.FL2023★ 1 cited
A Fast Algorithm for Computing Prefix Probabilities
Franz Nowak, Ryan Cotterell
Multiple algorithms are known for efficiently calculating the prefix probability of a string under a probabilistic context-free grammar (PCFG). Good algorithms for the problem have…