2 citations · 3 across the 4 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2024★ 1 cited
Complexity Aspects of the Extension of Wagner's Hierarchy to -Partitions
Vladimir Podolskii, Victor Selivanov
It is known that the Wadge reducibility of regular -languages is efficiently decidable (Krishnan et al., 1995), (Wilke, Yoo, 1995). In this paper we study analogous problem for…
cs.FL2023★ 2 cited
Logical Languages Accepted by Transformer Encoders with Hard Attention
Pablo Barcelo, Alexander Kozachinskiy, Anthony Widjaja Lin +1
We contribute to the study of formal languages that can be recognized by transformer encoders. We focus on two self-attention mechanisms: (1) UHAT (Unique Hard Attention Transforme…