Nie jesteś zalogowany |
Towards effective characterizations of data languages.
- Prelegent(ci)
- Clemens Ley
- Afiliacja
- Oxford
- Termin
- 17 marca 2010 14:15
- Pokój
- p. 5870
- Seminarium
- Seminarium „Teoria automatów”
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.
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.
