[PDF][PDF] Synthesis of computable regular functions of infinite words
Regular functions from infinite words to infinite words can be equivalently specified by MSO-
transducers, streaming ω-string transducers as well as deterministic twoway transducers …
transducers, streaming ω-string transducers as well as deterministic twoway transducers …
Euclidean division by d in base b
JÉ Pin - Theoretical Computer Science, 2025 - Elsevier
Let b⩾ 2 be an integer. For each positive integer d, let E d, b be the Euclidean division by d
in base b, that is, the function which associates to a word u in {0,…, b− 1}⁎, representing an …
in base b, that is, the function which associates to a word u in {0,…, b− 1}⁎, representing an …
The Algebras for Automatic Relations
R Morvan - arXiv preprint arXiv:2404.15496, 2024 - arxiv.org
We introduce" synchronous algebras", an algebraic structure tailored to recognize automatic
relations (aka synchronous relations, or regular relations). They are the equivalent of …
relations (aka synchronous relations, or regular relations). They are the equivalent of …