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…
math.LO2024
Equational theory of ordinals with addition and left multiplication by
Christian Choffrut
We show that the equational theory of the structure is finitely axiomatizable and give a simple axiom schema when the domain i…
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…