14 citations · 15 across the 4 of their papers we have counts for
5 papers · 1 filter
Characterization and Decidability of FC-Definable Regular Languages
Sam M. Thompson, Nicole Schweikardt, Dominik D. Freydenberger
FC is a first-order logic that reasons over all factors of a finite word using concatenation, and can define non-regular languages like that of all squares (ww). In this paper, we…
FC-Datalog as a Framework for Efficient String Querying
Owen M. Bell, Joel D. Day, Dominik D. Freydenberger
Core spanners are a class of document spanners that capture the core functionality of IBM's AQL. FC is a logic on strings built around word equations that when extended with constr…
Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC
Sam M. Thompson, Dominik D. Freydenberger
Despite considerable research on document spanners, little is known about the expressive power of generalized core spanners. In this paper, we use Ehrenfeucht-Fraïssé games to obta…
The theory of concatenation over finite models
Dominik D. Freydenberger, Liat Peterfreund
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of con…
Dynamic Complexity of Document Spanners
Dominik D. Freydenberger, Sam M. Thompson
The present paper investigates the dynamic complexity of document spanners, a formal framework for information extraction introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (JA…