Towards effective characterizations of data languages.

Speaker(s)

Clemens Ley

Affiliation

Oxford

Date

March 17, 2010, 2:15 p.m.

Room

room 5870

Seminar

Seminar Automata Theory

---

We study the following decision problem. Given a deterministic
register automaton and a logic, decide if the language recognized by
the register automaton can be defined in the logic. This study
requires new insights into deterministic register automata, such as
the notion of a minimal deterministic register automaton.

---