ERC Consolidator Grant · 2022
Logic and Automata over Sequences with Data
Formal language theory is indisputably one of the most successful theories in theoretical computer science with many applications in such fields as formal verification, programming languages, and databases, to name a few. Despite this, the standard restriction to finite alphabets has been a limiting factor in the applicability of the theory in various important application domains, wherein sequences with data (i.e. ranging over an infinite domain like the set of integers and the set of strings) naturally arise. This has motivated an extensive study of automata over infinite alphabets in the last three decades, which aims to develop algorithms for analyzing data languages. It was, however,…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.