- Speaker(s)
- Laurent Braud
- Affiliation
- Institut Gaspard Monge in Marne-la-Vallée
- Date
- Oct. 20, 2010, 2:15 p.m.
- Room
-
room 5870
- Seminar
- Seminar Automata Theory
We will look at infinite words which are the leaves in lexicographic order of a deterministic tree (in the case where the order type of this object is omega). When the tree can be generated by an order-1 recursion scheme, the corresponding words are known as morphic words. The natural question is then : what are the words generated by higher-order recursion schemes? I will provide an answer for order 2.
You are not logged in |
