24 citations · 63 across the 14 of their papers we have counts for
14 papers
Algebraic Decomposition Theory for Transformer Length Generalization
Andy Yang, Blerta Veseli, Corentin Barloy +5
Transformer-based language models are known to sometimes generalize to sequences longer than seen during training, but we lack a precise characterization of which tasks admit lengt…
The Alternation Hierarchy of First-Order Logic on Words is Decidable
Corentin Barloy, Michaël Cadilhac, Charles Paperman +1
We show that for any , it is decidable, given a regular language, whether it is expressible in the fragment of first-order logic FO[<]. This settles a question open…
Regular languages defined by first-order formulas without quantifier alternation
Andreas Krebs, Howard Straubing
We give a simple new proof that regular languages defined by first-order sentences with no quantifier alteration can be defined by such sentences in which only regular atomic formu…
Wreath Products of Distributive Forest Algebras
Michael Hahn, Andreas Krebs, Howard Straubing
It is an open problem whether definability in Propositional Dynamic Logic (PDL) on forests is decidable. Based on an algebraic characterization by Bojańczyk, et. al.,(2012) in term…
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership
Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya +1
We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variabl…
Difference hierarchies and duality with an application to formal languages
Célia Borlido, Mai Gehrke, Andreas Krebs +1
The notion of a difference hierarchy, first introduced by Hausdorff, plays an important role in many areas of mathematics, logic and theoretical computer science such as descriptiv…