BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Pierre Popoli (Université de Lorraine) DTSTART:20220315T133000Z DTEND:20220315T143000Z DTSTAMP:20260423T052931Z UID:OWNS/79 DESCRIPTION:Title: Ma ximum order complexity for some automatic and morphic sequences along poly nomial values\nby Pierre Popoli (Université de Lorraine) as part of O ne World Numeration seminar\n\n\nAbstract\nAutomatic sequences are not sui table sequences for cryptographic applications since both their subword co mplexity and their expansion complexity are small\, and their correlation measure of order 2 is large. These sequences are highly predictable despit e having a large maximum order complexity. However\, recent results show t hat polynomial subsequences of automatic sequences\, such as the Thue-Mors e sequence or the Rudin-Shapiro sequence\, are better candidates for pseud orandom sequences. A natural generalization of automatic sequences are mor phic sequences\, given by a fixed point of a prolongeable morphism that is not necessarily uniform. In this talk\, I will present my results on lowe rs bounds for the maximum order complexity of the Thue-Morse sequence\, th e Rudin-Shapiro sequence and the sum of digits function in Zeckendorf base \, which are respectively automatics and morphic sequences.\n LOCATION:https://researchseminars.org/talk/OWNS/79/ END:VEVENT END:VCALENDAR