2000 character limit reached
HD0L-$ω$-equivalence and periodicity problems in the primitive case (to the memory of G. Rauzy)
Published 2 Nov 2011 in math.CO and cs.DM | (1111.0650v1)
Abstract: In this paper I would like to witness the mathematical inventiveness of G. Rauzy through personnal exchanges I had with him. The objects that will emerge will be used to treat the decidability of the HD 0 L $\omega$-equivalence and periodicity problems in the primitive case.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.