Christof Löding

Constructing deterministic $\omega$-automata from examples by an extension of the RPNI algorithm

2021 · arXiv (Cornell University)

The RPNI algorithm (Oncina, Garcia 1992) constructs deterministic finite automata from finite sets of negative and positive example words. We propose and analyze an extension of this algorithm to deterministic $\omega$-automata with different types of …

A First-Order Logic with Frames

2019 · arXiv (Cornell University)

We propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formulas -- the precise subset of the universe upon …