joint work with Thomas Colcombet

I will describe Data automata, FO^2 and some natural fragments of Data automata defined by classes of Mu-calculus formulas and wrap it up by separating two classes using the circuits we discussed last time. If time permits we can have a look at the infinite data words case also.