Symbolic automata tutorial, part II: extensions

Margus Veanes

Microsoft Research, Redmond, WA

Tuesday, 20 December 2016, 14:00 (note the unusual weekday)
Cybernetica Bldg (Akadeemia tee 21), room B101

Abstract: Symbolic finite automata extend classical automata by allowing transitions to carry predicates over an effective Boolean algebra, instead of concrete labels. In this talk, the focus is on some extensions of the basic model and we look at some decision problems that are unique to the symbolic settings. In particular, we consider symbolic automata with lookahead, with output or transducers, tree-automata and we look at some code generation tasks.

This is the last computer science seminar to be held at what was the Institute of Cybernetics (1960-2016).

Tarmo Uustalu
Last update 19 December 2016