- Prelegent(ci)
- Laurent Braud
- Afiliacja
- Institut Gaspard Monge in Marne-la-Vallée
- Termin
- 20 października 2010 14:15
- Pokój
-
p. 5870
- Seminarium
- Seminarium „Teoria automatów”
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.
Nie jesteś zalogowany |
