3 papers
cs.LO2024
Message complexity for unary multiautomata systems
Christian Choffrut
Finitely many two-way automata work independently and synchronously on a unary input. Some of their states are broadcasting, i.e., dispatched to all other automata. At each step of…
cs.FL2023
Synchronous orders on the set of integers
Christian Choffrut
A binary relation over a free monoid is synchronous if it can be recognized by a synchronous automaton that reads its two tapes simultaneously. We consider the case where the free…
math.CO2022
Grammic monoids with three generators
Christian Choffrut
Young tableaux are combinatorial objects whose construction can be achieved from words over a finite alphabet by row or column insertion as shown by Schensted sixty years ago. Rece…